4488 search results - page 47 / 898 » Focusing Search by Using Problem Solving Experience |
114
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a g...
130
Voted
EUROSYS
2006
ACM
15 years 11 months ago
2006
ACM
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
141
Voted
FLAIRS
2007
15 years 4 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
203
Voted
CP
2009
Springer
16 years 3 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
152
Voted
AI
2008
Springer
15 years 2 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...