Sciweavers

566 search results - page 16 / 114
» Solution Reuse in Dynamic Constraint Satisfaction Problems
Sort
View
CP
1995
Springer
15 years 3 months ago
Partial Constraint Satisfaction
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...
Eugene C. Freuder, Richard J. Wallace
CPAIOR
2008
Springer
15 years 2 months ago
Fitness-Distance Correlation and Solution-Guided Multi-point Constructive Search for CSPs
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a complete, constructive search technique that has been shown to out-perform standard constructive search techniques on ...
Ivan Heckman, J. Christopher Beck
CORR
2010
Springer
106views Education» more  CORR 2010»
15 years 13 days ago
Symmetry within Solutions
We define the concept of an internal symmetry. This is a symmety within a solution of a constraint satisfaction problem. We compare this to solution symmetry, which is a mapping b...
Marijn Heule, Toby Walsh
CORR
2011
Springer
160views Education» more  CORR 2011»
14 years 4 months ago
Compositional Model Repositories via Dynamic Constraint Satisfaction with Order-of-Magnitude Preferences
The predominant knowledge-based approach to automated model construction, compositional modelling, employs a set of models of particular functional components. Its inference mecha...
Jeroen Keppens, Qiang Shen
102
Voted
AMAI
1999
Springer
15 years 10 hour ago
Maintenance scheduling problems as benchmarks for constraint algorithms
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
Daniel Frost, Rina Dechter