62 search results - page 12 / 13 » Modeling Agents That Exhibit Variable Performance in a Colla... |
AAAI
1994
13 years 6 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
TRIER
2002
13 years 4 months ago
2002
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
This report outlines the use of a relational representation in a Multi-Agent domain to model the behaviour of the whole system. A desired property in this systems is the ability of...
ECAI
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...
SENSYS
2006
ACM
13 years 11 months ago
2006
ACM
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...