Sciweavers

2996 search results - page 107 / 600
» Numberings and Randomness
Sort
View
OPODIS
2004
15 years 6 months ago
Comparison of Failures and Attacks on Random and Scale-Free Networks
Abstract. It appeared recently that some statistical properties of complex networks like the Internet, the World Wide Web or Peer-to-Peer systems have an important influence on the...
Jean-Loup Guillaume, Matthieu Latapy, Cléme...
AI
2002
Springer
15 years 5 months ago
Parallel Randomized Best-First Minimax Search
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
Yaron Shoham, Sivan Toledo
RSA
2002
69views more  RSA 2002»
15 years 5 months ago
On the covariance of the level sizes in random recursive trees
In this paper we study the covariance structure of the number of nodes k and l steps away from the root in random recursive trees. We give an analytic expression valid for all k, ...
Remco van der Hofstad, Gerard Hooghiemstra, Piet V...
STACS
2004
Springer
15 years 10 months ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...
RSA
2002
99views more  RSA 2002»
15 years 5 months ago
Distributed algorithms with dynamical random transitions
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
Nadine Guillotin-Plantard, René Schott