73 search results - page 6 / 15 » Random Walk on Directed Dynamic Graphs |
AUSAI
2005
Springer
14 years 3 months ago
2005
Springer
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...
WEBI
2007
Springer
14 years 3 months ago
2007
Springer
There are information needs involving costly decisions that cannot be efficiently satisfied through conventional web search engines. Alternately, community centric search can prov...
CC
2008
Springer
13 years 9 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...
COCO
2007
Springer
14 years 3 months ago
2007
Springer
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...