566 search results - page 24 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
132
Voted
ECAI
1992
Springer
15 years 3 months ago
1992
Springer
Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NP-complete task, man...
ECAI
2004
Springer
15 years 5 months ago
2004
Springer
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
113
Voted
CORR
2010
Springer
15 years 14 days ago
2010
Springer
Symmetry can be used to help solve many problems. For instance, Einstein's famous 1905 paper ("On the Electrodynamics of Moving Bodies") uses symmetry to help derive...
115
click to vote
AAAI
2007
15 years 2 months ago
2007
Solving logic puzzles has become a very popular past-time, particularly since the Sudoku puzzle started appearing in newspapers all over the world. We have developed a puzzle gene...
112
click to vote
FLAIRS
2008
15 years 2 months ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...