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...
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
The global search properties of heuristic search algorithms are not well understood. In this paper, we introduce a new metric, mobility, that quantifies the dispersion of local o...
Monte Lunacek, L. Darrell Whitley, James N. Knight
This paper deals with a multi-stage two-person zero-sum game called the multi-stage search allocation game (MSSAG), in which a searcher and an evader participate. The searcher dist...