Sciweavers

8728 search results - page 73 / 1746
» On Reduct Construction Algorithms
Sort
View
FSTTCS
2008
Springer
15 years 3 days ago
On the Power of Imperfect Information
We present a polynomial-time reduction from parity games with imperfect information to safety games with imperfect information. Similar reductions for games with perfect informatio...
Dietmar Berwanger, Laurent Doyen
105
Voted
APCSAC
2006
IEEE
15 years 5 months ago
A Context-Switch Reduction Heuristic for Power-Aware Off-Line Scheduling
Abstract. Scheduling algorithms significantly affect the performance of a realtime system. In systems with power constraints, context switches in a schedule result in wasted power ...
Biju K. Raveendran, Sundar Balasubramaniam, K. Dur...
73
Voted
TACAS
2005
Springer
86views Algorithms» more  TACAS 2005»
15 years 4 months ago
Complementation Constructions for Nondeterministic Automata on Infinite Words
Orna Kupferman, Moshe Y. Vardi
WADS
1997
Springer
74views Algorithms» more  WADS 1997»
15 years 3 months ago
Constructing Pairwise Disjoint Paths with Few Links
Himanshu Gupta, Rephael Wenger