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...
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...
The forward checking algorithm for solving constraint satisfaction problems is a popular and successful alternative to backtracking. However, its successhas largely been determined...
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...
Kenneth M. F. Choi, Jimmy Ho-Man Lee, Peter J. Stu...
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...
Ya'akov Gal, Swapna Reddy, Stuart M. Shieber, Ande...