419 search results - page 58 / 84 » An LP-Designed Algorithm for Constraint Satisfaction |
CP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. 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 de...
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
CP
1995
Springer
14 years 1 days ago
1995
Springer
The forward checking algorithm for solving constraint satisfaction problems is a popular and successful alternative to backtracking. However, its successhas largely been determined...
AI
2000
Springer
13 years 8 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
AI
2012
Springer
12 years 4 months ago
2012
Springer
This paper describes a challenging plan recognition problem that arises in environments in which agents engage widely in exploratory behavior, and presents new algorithms for eff...