634 search results - page 118 / 127 » Completion Procedures as Semidecision Procedures |
STOC
2010
ACM
14 years 6 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...
AGENTS
2001
Springer
13 years 12 months ago
2001
Springer
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
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...
SIGUCCS
2000
ACM
13 years 11 months ago
2000
ACM
This paper will provide a useful guide to those schools that have not yet implemented IMAP and are considering doing so. With both the systems and user services perspectives, any ...
MOBICOM
1996
ACM
13 years 11 months ago
1996
ACM
This paper discusses extensions to the Rover toolkit for constructing reliable mobile-aware applications. The extensions improve upon the existing failure model, which only addres...