566 search results - page 38 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
145
Voted
AMAI
1999
Springer
15 years 4 days ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
CP
2006
Springer
15 years 4 months ago
2006
Springer
We reconsider the idea of structural symmetry breaking (SSB) for constraint satisfaction problems (CSPs). We show that the dynamic dominance checks used in symmetry breaking by dom...
84
Voted
AAAI
2006
15 years 1 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
106
click to vote
PATAT
2004
Springer
15 years 5 months ago
2004
Springer
Timetabling problems have been frequently studied due to their wide range of applications. However, they are often solved manually because of the lack of appropriate computer tools...
88
Voted
ICCAD
2004
IEEE
15 years 9 months ago
2004
IEEE
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...