733 search results - page 80 / 147 » Recommending random walks |
EPEW
2005
Springer
15 years 3 months ago
2005
Springer
We introduce and study a new model: 0-automatic queues. Roughly, 0-automatic queues are characterized by a special buffering mechanism evolving like a random walk on some infini...
ICANNGA
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. In this paper, five previous Particle Swarm Optimization (PSO) algorithms for multimodal function optimization are reviewed. A new and a successful PSO based algorithm, n...
ENTCS
2008
14 years 10 months ago
2008
We study explicit techniques for detection of safety errors, e.g., depth-first search, directed search, random walk, and bitstate hashing. We argue that it is not important to fin...
118
click to vote
COMBINATORICS
2006
14 years 9 months ago
2006
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly con...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We show that the space of polygonizations of a fixed planar point set S of n points is connected by O(n2 ) “moves” between simple polygons. Each move is composed of a sequence...