1414 search results - page 111 / 283 » Cover Time and Broadcast Time |
72
Voted
ARSCOM
2000
14 years 10 months ago
2000
The minimum number of incomplete blocks required to cover, exactly times, all t-element subsets from a set V of cardinality v (v > t) is denoted
SIAMDM
2010
14 years 5 months ago
2010
If m 2 is constant and 0 r log log n for a small positive constant , then whp a random walk with look-ahead r on a scale-free graph G = G(m, n) has cover time CG(r) (2/(mr-1(...
ICRA
2006
IEEE
15 years 4 months ago
2006
IEEE
— We describe a novel shape formation algorithm for ensembles of 2-dimensional lattice-arrayed modular robots, based on the manipulation of regularly shaped voids within the latt...
91
Voted
CP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to t...
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
— The connected dominating set (CDS) has been extensively used for routing and broadcast in mobile ad hoc networks. While existing CDS protocols are successful in constructing CD...