612 search results - page 69 / 123 » An Empirical Study of Agent Programs |
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game...
CP
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
POPL
2001
ACM
14 years 9 months ago
2001
ACM
This paper addresses the design and verification of infrastructure for mobile computation. In particular, we study language primitives for communication between mobile agents. The...
SARA
2009
Springer
14 years 3 months ago
2009
Springer
Perfect recall is the common and natural assumption that an agent never forgets. As a consequence, the agent can always condition its choice of action on any prior observations. I...
AAAI
1998
13 years 10 months ago
1998
Production planning is an important task in manufacturing systems. We consider a real-world capacitated lot-sizing problem (CLSP) from the process industry. Because the problem re...