Local search algorithms often get trapped in local optima. Algorithms such as tabu search and simulated annealing 'escape' local optima by accepting nonimproving moves. ...
Laura Barbulescu, Jean-Paul Watson, L. Darrell Whi...
Although much has been written about various information integration technologies, little has been said regarding how to combine these technologies together to build an entire &qu...
Greg Barish, Craig A. Knoblock, Yi-Shin Chen, Stev...
This paper describes the software architecture of an autonomous tour-guide/tutor robot. This robot was recently deployed in the "Deutsches Museum Bonn," were it guided h...
Wolfram Burgard, Armin B. Cremers, Dieter Fox, Dir...
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
qYaditionally, constraint satisfaction problems(CSPs) are characterized using a finite set of constraints expressed within a common,shared constraint language. Whenreasoning acros...