5153 search results - page 88 / 1031 » Introduction to Randomized Algorithms |
112
click to vote
SAT
2005
Springer
15 years 7 months ago
2005
Springer
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
110
click to vote
WDAG
2010
Springer
15 years 20 days ago
2010
Springer
Most people believe that renaming is easy: simply choose a name at random; if more than one process selects the same name, then try again. We highlight the issues that occur when t...
115
click to vote
SIAMDM
2002
15 years 1 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
127
click to vote
CCA
2009
Springer
15 years 9 months ago
2009
Springer
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
101
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...