1429 search results - page 58 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
ATAL
2003
Springer
15 years 3 months ago
2003
Springer
Decentralized control of a cooperative multi-agent system is the problem faced by multiple decision-makers that share a common set of objectives. The decision-makers may be robots...
107
click to vote
PODS
2001
ACM
15 years 10 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
The ability to coordinate effectively is critical for agents to accomplish their goals in a multi-agent system. A number of researchers have modeled the coordination problem for m...
STOC
2002
ACM
15 years 10 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
TON
2008
14 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...