9842 search results - page 61 / 1969 » Problem complexity |
INFOCOM
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
TSMC
2008
13 years 9 months ago
2008
Testing complex manufacturing systems, such as an ASML [1] lithographic machine, takes up to 45% of the total development time of a system. The problem of which tests must be execu...
AI
2005
Springer
13 years 9 months ago
2005
Springer
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
ATVA
2010
Springer
13 years 10 months ago
2010
Springer
In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform c...
SAT
2004
Springer
14 years 3 months ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...