1612 search results - page 155 / 323 » Analysing Randomized Distributed Algorithms |
127
Voted
IJCAI
2001
15 years 6 months ago
2001
We describe two market-inspired approaches to propositional satisfiability. Whereas a previous market-inspired approach exhibited extremely slow performance, we find that variatio...
144
click to vote
PPSN
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we use the exact model (or dynamical system approach) to describe the standard evolutionary algorithm (EA) as a discrete dynamical system for dynamic optimization pr...
127
Voted
COLCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—Nodes within existing P2P networks typically exchange periodic keep-alive messages in order to maintain network connections between neighbours. This paper investigates a...
114
Voted
ESA
2003
Springer
15 years 10 months ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
142
click to vote
AAAI
2007
15 years 7 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...