Sciweavers

387 search results - page 1 / 78
» Many Random Walks Are Faster Than One
Sort
View
CPC
2011
240views Education» more  CPC 2011»
12 years 7 months ago
Many Random Walks Are Faster Than One
Noga Alon, Chen Avin, Michal Koucký, Gady K...
COMPGEOM
1994
ACM
13 years 7 months ago
Computing Many Faces in Arrangements of Lines and Segments
We present randomized algorithms for computing many faces in an arrangement of lines or of segments in the plane, which are considerably simpler and slightly faster than the previo...
Pankaj K. Agarwal, Jirí Matousek, Otfried S...
CORR
2002
Springer
91views Education» more  CORR 2002»
13 years 3 months ago
Quantum Random Walks Hit Exponentially Faster
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential ...
Julia Kempe
GECCO
2003
Springer
103views Optimization» more  GECCO 2003»
13 years 8 months ago
Are Multiple Runs of Genetic Algorithms Better than One?
Abstract. There are conflicting reports over whether multiple independent runs of genetic algorithms (GAs) with small populations can reach solutions of higher quality or can fin...
Erick Cantú-Paz, David E. Goldberg
PODC
2009
ACM
14 years 4 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...