The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
Planning as satisfiability is a principal approach to planning with many eminent advantages. The existing planning as satisfiability techniques usually use encodings compiled from...
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
In recent models of decision-making, cognitive scientists have examined the relationship between option generation and successful performance. These models suggest that those who a...
Paul Ward, Joel Suss, David W. Eccles, A. Mark Wil...
Ant robots have very low computational power and limited memory. They communicate by leaving pheromones in the environment. In order to create a cooperative intelligent behavior, ...
Asaf Shiloni, Alon Levy, Ariel Felner, Meir Kalech