4281 search results - page 816 / 857 » How to Disembed a Program |
GECCO
2003
Springer
14 years 25 days ago
2003
Springer
The formation of fruiting bodies by myxobacteria colonies involves altruistic suicide by many individual bacteria and is thus vulnerable to exploitation by cheating mutants. We rep...
ICALP
2003
Springer
14 years 24 days ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
STOC
2010
ACM
14 years 14 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...
ICALP
2001
Springer
14 years 2 days ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
LPAR
2001
Springer
14 years 1 days ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...