36 search results - page 5 / 8 » Dynamic Prioritization of Complex Agents in Distributed Cons... |
CP
2004
Springer
13 years 11 months ago
2004
Springer
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
AAAI
2006
13 years 9 months ago
2006
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
AAAI
2008
13 years 9 months ago
2008
Particle filtering algorithms can be used for the monitoring of dynamic systems with continuous state variables and without any constraints on the form of the probability distribu...
AAAI
2000
13 years 9 months ago
2000
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
— This paper considers the problem of coordinating multiple vehicles with kinodynamic constraints that operate in the same partially-known environment. The vehicles are able to c...