2899 search results - page 475 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
106
click to vote
DC
2010
15 years 1 months ago
2010
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
119
click to vote
SECON
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract--Due to technology or policy constraints, communications across network domains usually require the intervention of gateways, and their proper deployment is crucial to the...
107
click to vote
RECOMB
2005
Springer
16 years 1 months ago
2005
Springer
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...
121
click to vote
RECOMB
2004
Springer
16 years 1 months ago
2004
Springer
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
116
click to vote
STOC
2004
ACM
16 years 1 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...