717 search results - page 42 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
107
click to vote
ACST
2006
14 years 11 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
109
click to vote
CONSTRAINTS
1998
14 years 9 months ago
1998
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
IJCAI
2003
14 years 11 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
CPAIOR
2008
Springer
14 years 11 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...