Sciweavers

5153 search results - page 74 / 1031
» Introduction to Randomized Algorithms
Sort
View
AI
2006
Springer
15 years 1 months ago
On the Quality and Quantity of Random Decisions in Stochastic Local Search for SAT
Stochastic local search (SLS) methods are underlying some of the best-performing algorithms for certain types of SAT instances, both from an empirical as well as from a theoretical...
Dave A. D. Tompkins, Holger H. Hoos
CSC
2009
14 years 11 months ago
Improving Random Walk Performance
Random walk simulation is employed in many experimental algorithmic applications. Efficient execution on modern computer architectures demands that the random walk be implemented t...
Ilya Safro, Paul D. Hovland, Jaewook Shin, Michell...
WAW
2007
Springer
105views Algorithms» more  WAW 2007»
15 years 3 months ago
Deterministic Decentralized Search in Random Graphs
Esteban Arcaute, Ning Chen, Ravi Kumar, David Libe...
STOC
1993
ACM
103views Algorithms» more  STOC 1993»
15 years 1 months ago
Efficient learning of typical finite automata from random walks
Yoav Freund, Michael J. Kearns, Dana Ron, Ronitt R...
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
14 years 11 months ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...