1662 search results - page 32 / 333 » The Computational Complexity of Agent Design Problems |
COMPULOG
1999
Springer
13 years 12 months ago
1999
Springer
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
ECAIW
2000
Springer
13 years 12 months ago
2000
Springer
This paper discusses the hierarchical control architecture used to generate the behavior of individual agents and a team of robots for the RoboCup Small Size competition. Our react...
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
Our approach to the spatial coordination problem relies on parametrized force fields. Through a quantitative comparison on a complex spatial coordination problem treated with a s...
AAAI
1998
13 years 9 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Autonomic computing is being advocated as a tool for maintaining and managing large, complex computing systems. Self-organising multi-agent systems provide a suitable par...