2583 search results - page 194 / 517 » On the Representation of Timed Polyhedra |
152
click to vote
AAAI
2008
15 years 8 months ago
2008
This paper addresses the problem of plan recognition for multi-agent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. ...
173
click to vote
AIPS
2007
15 years 8 months ago
2007
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...
167
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
This paper addresses the problem of plan recognition for multiagent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. T...
167
click to vote
IJCAI
2007
15 years 8 months ago
2007
This paper investigates how to represent and solve multiagent task scheduling as a Distributed Constraint Optimization Problem (DCOP). Recently multiagent researchers have adopted...
167
click to vote
STRINGOLOGY
2008
15 years 8 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...