13603 search results - page 64 / 2721 » On the Complexity of Computing Treelength |
ICMAS
2000
13 years 10 months ago
2000
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
TON
2008
13 years 9 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
AI
2004
Springer
13 years 9 months ago
2004
Springer
We study coalitional games in which agents are each assumed to have a goal to be achieved, and where the characteristic property of a coalition is a set of choices, with each choi...
CIE
2008
Springer
13 years 11 months ago
2008
Springer
STOC
2004
ACM
14 years 9 months ago
2004
ACM