566 search results - page 21 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
102
click to vote
AIPS
2008
15 years 2 months ago
2008
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the e...
AMAI
2004
Springer
15 years 5 months ago
2004
Springer
In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is ...
IJCAI
1989
15 years 1 months ago
1989
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...
116
click to vote
ECAI
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...
88
Voted
AAAI
1997
15 years 1 months ago
1997
The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the proba...