2446 search results - page 416 / 490 » Choiceless Polynomial Time |
CP
2011
Springer
12 years 7 months ago
2011
Springer
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
IACR
2011
12 years 7 months ago
2011
We put forward a framework for the modular design and analysis of multi-party protocols. Our framework is called “GNUC” (with the recursive meaning “GNUC’s Not UC”), alr...
RTSS
1992
IEEE
13 years 11 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
IJCAI
1993
13 years 9 months ago
1993
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...