Sciweavers

3257 search results - page 63 / 652
» Some Results on Effective Randomness
Sort
View
CPC
1998
154views more  CPC 1998»
14 years 9 months ago
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...
Brendan D. McKay, Robert W. Robinson
PPL
2000
110views more  PPL 2000»
14 years 9 months ago
Faulty Random Geometric Networks
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
Josep Díaz, Jordi Petit, Maria J. Serna
CIE
2008
Springer
14 years 11 months ago
Effective Dimensions and Relative Frequencies
Consider the problem of calculating the fractal dimension of a set X consisting of all infinite sequences S over a finite alphabet that satisfy some given condition P on the asympt...
Xiaoyang Gu, Jack H. Lutz
AROBOTS
2002
93views more  AROBOTS 2002»
14 years 9 months ago
Mathematical Model of Foraging in a Group of Robots: Effect of Interference
Abstract. In multi-robot applications, such as foraging or collection tasks, interference, which results from competition for space between spatially extended robots, can significa...
Kristina Lerman, Aram Galstyan
CP
1997
Springer
15 years 1 months ago
Random Constraint Satisfaction: A More Accurate Picture
In the last few years there has been a great amount of interest in Random Constraint Satisfaction Problems, both from an experimental and a theoretical point of view. Quite intrigu...
Dimitris Achlioptas, Lefteris M. Kirousis, Evangel...