314 search results - page 60 / 63 » Complete Problems for Dynamic Complexity Classes |
FOCS
2000
IEEE
13 years 11 months ago
2000
IEEE
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
CLIMA
2007
13 years 8 months ago
2007
Abstract. Task-based planning problems for multi-agent systems require multiple agents to find a joint plan for a constrained set of tasks. Typically, each agent receives a subset...
P2P
2007
IEEE
14 years 1 months ago
2007
IEEE
Structured overlay networks form a major class of peerto-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-s...
STOC
2010
ACM
14 years 7 days ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
IMR
1999
Springer
13 years 11 months ago
1999
Springer
The primary focus of this project is to design and implement a parallel framework for an unstructured mesh generator based on the advancing front method (AFM). In particular, we t...