5153 search results - page 318 / 1031 » Introduction to Randomized Algorithms |
133
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
113
click to vote
EUROPAR
2001
Springer
15 years 8 months ago
2001
Springer
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
125
click to vote
PPSN
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Three theoretical perspectives upon conservation of performance in function optimization are outlined. In terms of statistical information, performance is conserved when ...
158
click to vote
AAAI
2010
15 years 5 months ago
2010
We present novel randomized algorithms for solving global motion planning problems that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data...
124
click to vote
WSC
2001
15 years 5 months ago
2001
Congestion control algorithms, such as TCP or the closelyrelated additive increase-multiplicative decrease algorithms, are extremely difficult to simulate on a large scale. The re...