1662 search results - page 165 / 333 » The Computational Complexity of Agent Design Problems |
137
click to vote
KESAMSTA
2007
Springer
15 years 10 months ago
2007
Springer
Queueing Theory deals with problems where some restricted resource should be shared between competitive flow of requests. In this paper we use Queueing Theory methods to perform a...
124
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
This work considers the problem of designing optimal multi-agent trajectories to patrol an environment. As performance criterion for optimal patrolling we consider the worst-case t...
124
click to vote
GRAPHICSINTERFACE
2007
15 years 5 months ago
2007
Material limitations and fabrication costs generally run at odds with the creativity of architectural design, producing a wealth of challenging computational geometry problems. We...
161
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
140
click to vote
NMR
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we introduce a new method to recover from discrepancies in a general monitoring framework where the agent finds some explanations (points of failure) for discrepan...