920 search results - page 1 / 184 » Generating Satisfiable Problem Instances |
AAAI
2000
13 years 5 months ago
2000
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
IJCAI
2001
13 years 5 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
ER
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Recent developments in reification of ER schemata include automatic generation of webbased database administration systems [1,2]. These systems enforce the schema cardin...
DATE
2000
IEEE
13 years 9 months ago
2000
IEEE
The Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic verification. SAT has bee...
TAINN
2005
Springer
13 years 10 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...