Sciweavers

5153 search results - page 95 / 1031
» Introduction to Randomized Algorithms
Sort
View
GECCO
2009
Springer
118views Optimization» more  GECCO 2009»
15 years 7 months ago
Benchmarking the pure random search on the BBOB-2009 noisy testbed
We benchmark the Pure-Random-Search algorithm on the BBOB 2009 noisy testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space dimensi...
Anne Auger, Raymond Ros
SSDBM
1990
IEEE
94views Database» more  SSDBM 1990»
15 years 6 months ago
Random Sampling from Database Files: A Survey
In this paper we survey known results on algorithms, data structures, and some applications of random sampling from databases. We first discuss various reasons for sampling from d...
Frank Olken, Doron Rotem
RSA
2006
68views more  RSA 2006»
15 years 2 months ago
The probabilistic analysis of a greedy satisfiability algorithm
: On input a random 3-CNF formula of clauses-to-variables ratio r3 applies repeatedly the following simple heuristic: Set to True a literal that appears in the maximum number of cl...
Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios...
WWW
2004
ACM
16 years 3 months ago
The effect of the back button in a random walk: application for pagerank
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
Fabien Mathieu, Mohamed Bouklit
CP
2004
Springer
15 years 7 months ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore