3758 search results - page 334 / 752 » A Complete Subsumption Algorithm |
175
click to vote
ECRTS
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper, we explore the feasibility and performance optimization problems for real-time systems that must remain functional during an operation/mission with a fixed, initial...
171
click to vote
ACSD
2003
IEEE
15 years 10 months ago
2003
IEEE
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
184
click to vote
AAAI
2008
15 years 9 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
203
click to vote
AAAI
2008
15 years 9 months ago
2008
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
164
click to vote
IPCO
1998
15 years 8 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...