17 search results - page 2 / 4 » Making constraint solvers more usable: overconstraint proble... |
ICTAI
2008
IEEE
13 years 11 months ago
2008
IEEE
Boolean satisfiability (SAT) finds a wide range of practical applications, including Artificial Intelligence and, more recently, Bioinformatics. Although encoding some combinat...
CPAIOR
2008
Springer
13 years 7 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
ICCAD
2002
IEEE
14 years 2 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
CP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. There is no standard modelling language for constraint programming (CP) problems. Most solvers have their own modelling language. This makes it difficult for modellers to...
ATAL
2009
Springer
13 years 12 months ago
2009
Springer
Distributed constraint optimization (DCOP) provides a framework for coordinated decision making by a team of agents. Often, during the decision making, capacity constraints on age...