1331 search results - page 221 / 267 » Complexity bounds for zero-test algorithms |
MAAMAW
1993
Springer
13 years 11 months ago
1993
Springer
Autonomous agents working in multi-agent environments may need to cooperate in order to ful ll tasks. Given a set of agents and a set of tasks which they have to satisfy, we consi...
AIPS
2008
13 years 10 months ago
2008
Loosely coupled multi-agent systems are perceived as easier to plan for because they require less coordination between agent sub-plans. In this paper we set out to formalize this ...
COCO
2008
Springer
13 years 9 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
GRAPHICSINTERFACE
2007
13 years 9 months ago
2007
Modeling 3D objects and scenes is an important part of computer graphics. One approach to modeling is projecting binary patterns onto the scene in order to obtain correspondences ...
EDBT
2011
ACM
12 years 11 months ago
2011
ACM
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...