Sciweavers

1101 search results - page 77 / 221
» A robot agent that can search
Sort
View
AAAI
2006
15 years 7 months ago
Local-Search Techniques for Boolean Combinations of Pseudo-Boolean Constraints
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...
Lengning Liu, Miroslaw Truszczynski
AAAI
1996
15 years 7 months ago
Forward Estimation for Game-Tree Search
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
Weixiong Zhang
ATAL
2005
Springer
15 years 11 months ago
Multiagent planning through plan repair
We present a novel approach to multiagent planning for self-interested agents. The main idea behind our approach is that multiagent planning systems should be built upon (single-a...
Roman van der Krogt, Nico Roos, Mathijs de Weerdt,...
CEC
2005
IEEE
15 years 12 months ago
Evolutionary computation variants for cooperative spatial coordination
Abstract- This paper presents a comparative study between genetic and probabilistic search approaches of evolutionary computation. They are both applied for optimizing the behavior...
Georgios N. Yannakakis, John Hallam, John Levine
AAAI
2008
15 years 8 months ago
Anytime Local Search for Distributed Constraint Optimization
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small prob...
Roie Zivan