Sciweavers

3333 search results - page 374 / 667
» Optimal Power-Down Strategies
Sort
View
GD
2005
Springer
16 years 26 days ago
Non-planar Core Reduction of Graphs
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
Carsten Gutwenger, Markus Chimani
ISAAC
2003
Springer
97views Algorithms» more  ISAAC 2003»
16 years 18 days ago
Equilibria for Networks with Malicious Users
We consider the problem of characterizing user equilibria and optimal solutions for selfish routing in a given network. We extend the known models by considering malicious behavio...
George Karakostas, Anastasios Viglas
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
15 years 12 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
RTCSA
1999
IEEE
15 years 11 months ago
Schedulability-Driven Communication Synthesis for Time Triggered Embedded Systems
Abstract. We present an approach to static priority preemptive process scheduling for the synthesis of hard realtime distributed embedded systems where communication plays an impor...
Paul Pop, Petru Eles, Zebo Peng
CADE
1998
Springer
15 years 11 months ago
System Description: CRIL Platform for SAT
The CRIL multi-strategy platform for SAT includes a whole family of local search techniques and some of the best Davis and Putnam strategies for checking propositional satis abilit...
Bertrand Mazure, Lakhdar Sais, Éric Gr&eacu...