5138 search results - page 283 / 1028 » Randomized Algorithms for 3-SAT |
163
click to vote
GECCO
2007
Springer
16 years 22 days ago
2007
Springer
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
189
click to vote
COLT
2005
Springer
16 years 3 days ago
2005
Springer
In recent work Long and Servedio [LS05] presented a “martingale boosting” algorithm that works by constructing a branching program over weak classifiers and has a simple anal...
157
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
193
click to vote
INFOCOM
2005
IEEE
16 years 5 days ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
174
click to vote
STOC
1997
ACM
15 years 10 months ago
1997
ACM
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...