The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
Abstract. We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Go...
— Mobility models are widely used in simulation-based performance analyses of mobile networks. However, there is a trade-off between simplicity and realistic movement patterns. S...
The development of new Field-Programmed, MaskProgrammed and Laser-Programmed Gate Array architectures is hampered by the lack of realistic test circuits that exercise both the arc...
Michael D. Hutton, Jerry P. Grossman, Jonathan Ros...
A novel random text generation model is introduced. Unlike in previous random text models, that mainly aim at producing a Zipfian distribution of word frequencies, our model also ...