920 search results - page 15 / 184 » Generating Satisfiable Problem Instances |
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We propose a SAT-based algorithm for incremental diagnosis of discrete-event systems. The monotonicity is ensured by a prediction window that uses the future observations...
MASCOTS
2007
13 years 9 months ago
2007
Abstract— Wireless Mesh Networks are a scalable and costeffective solution for next-generation wireless networking. In the present work, we consider the Round Weighting Problem (...
ECAI
1994
Springer
13 years 11 months ago
1994
Springer
We describe a detailed experimental investigation of the phase transition for several different classes of randomly generated satisfiability problems. We observe a remarkable consi...
DAC
2005
ACM
13 years 9 months ago
2005
ACM
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...