Sciweavers

6393 search results - page 184 / 1279
» Randomized Algorithms on the Mesh
Sort
View
MOC
2011
14 years 11 months ago
Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
Using the concept of Geometric Weakly Admissible Meshes (see §2 below) together with an algorithm based on the classical QR factorization of matrices, we compute efficient points...
Len Bos, Jean-Paul Calvi, Norman Levenberg, Alvise...
AI
2006
Springer
15 years 7 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
15 years 5 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 10 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 8 months ago
Efficient learning of typical finite automata from random walks
Yoav Freund, Michael J. Kearns, Dana Ron, Ronitt R...