3758 search results - page 72 / 752 » A Complete Subsumption Algorithm |
COCO
2004
Springer
14 years 3 months ago
2004
Springer
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
AGENTS
2001
Springer
14 years 2 months ago
2001
Springer
We present a centralized and a distributed algorithms for scheduling multi-task agents in heterogeneous networks. Our centralized algorithm has an upper bound on the overall compl...
COCO
1989
Springer
14 years 1 months ago
1989
Springer
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...
MFCS
2001
Springer
14 years 2 months ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
RAS
2006
13 years 9 months ago
2006
This paper proposes a mobile printer system (MPS) based on multi-robot cooperation. The system consists of multiple mobile robots, a wireless LAN system, a graphic user interface ...