Sciweavers

242 search results - page 27 / 49
» Distributed algorithms with dynamical random transitions
Sort
View
160
Voted
PODC
2004
ACM
15 years 8 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
126
Voted
SIGIR
2006
ACM
15 years 8 months ago
Topical link analysis for web search
Traditional web link-based ranking schemes use a single score to measure a page’s authority without concern of the community from which that authority is derived. As a result, a...
Lan Nie, Brian D. Davison, Xiaoguang Qi
125
Voted
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
15 years 8 months ago
Distribution replacement: how survival of the worst can out perform survival of the fittest
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
Howard Tripp, Phil Palmer
JGAA
2006
120views more  JGAA 2006»
15 years 2 months ago
Distributing Unit Size Workload Packages in Heterogeneous Networks
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of neares...
Robert Elsässer, Burkhard Monien, Stefan Scha...
105
Voted
IJCAI
2001
15 years 4 months ago
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, Davi...