13603 search results - page 17 / 2721 » On the Computational Complexity of Cut-Reduction |
108
Voted
ANTS
1994
Springer
15 years 6 months ago
1994
Springer
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
110
click to vote
ICMAS
2000
15 years 3 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...
98
Voted
TON
2008
15 years 1 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...
108
Voted
AI
2004
Springer
15 years 1 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...
94
Voted
PC
2010
15 years 9 days ago
2010
The fat-tree is one of the topologies most widely used to build high-performance parallel computers. However, they are expensive and difficult to build. In this paper we propose t...