1591 search results - page 31 / 319 » Random lifts of graphs |
133
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
96
Voted
CAAN
2004
Springer
15 years 6 months ago
2004
Springer
We consider a generalized copy model of the web graph and related networks, and analyze its limiting behaviour. The model is motivated by previously proposed copying models of the ...
121
Voted
EMSOFT
2008
Springer
15 years 2 months ago
2008
Springer
The Simulink/Stateflow (SL/SF) environment from Mathworks is becoming the de facto standard in industry for model based development of embedded control systems. Many commercial to...
108
Voted
AUSAI
2005
Springer
15 years 6 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...
101
Voted
GFKL
2005
Springer
15 years 6 months ago
2005
Springer
Mining association rules is an important technique for discovering meaningful patterns in transaction databases. In the current literature, the properties of algorithms to mine ass...