5580 search results - page 663 / 1116 » Randomized priority algorithms |
270
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
142
click to vote
OPODIS
2010
15 years 2 months ago
2010
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...
117
click to vote
COCOON
2009
Springer
15 years 11 months ago
2009
Springer
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...
139
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
136
click to vote
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
Abstract— One key component of recent pricing-based congestion control schemes is an algorithm for probabilistically setting the Explicit Congestion Notification bit at routers ...