4759 search results - page 285 / 952 » Parallelizing the Phylogeny Problem |
218
Voted
ICDCN
2011
Springer
14 years 6 months ago
2011
Springer
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
94
Voted
CONCUR
2009
Springer
15 years 9 months ago
2009
Springer
One-counter automata are a fundamental and widely-studied class of infinite-state systems. In this paper we consider one-counter automata with counter updates encoded in binary—...
110
Voted
IPPS
2008
IEEE
15 years 9 months ago
2008
IEEE
Emerging configurable infrastructures (large-scale overlays, grids, distributed testbeds, and sensor networks among others) comprise diverse sets of computing resources and netwo...
132
Voted
SPAA
2004
ACM
15 years 8 months ago
2004
ACM
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
97
Voted
ICPPW
2003
IEEE
15 years 8 months ago
2003
IEEE
The resource allocation problem is a fundamental problem in distributed systems. In this paper, we focus on constructing nondominated (ND) local coteries to solve the problem. Dis...