91 search results - page 12 / 19 » On random points in the unit disk |
FSTTCS
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
ICSE
2007
IEEE-ACM
14 years 8 months ago
2007
IEEE-ACM
We present a technique that improves random test generation by incorporating feedback obtained from executing test inputs as they are created. Our technique builds inputs incremen...
COMBINATORICA
2011
12 years 8 months ago
2011
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
CORR
2000
Springer
13 years 8 months ago
2000
Springer
We consider the adaptation of random early detection (RED) as an active queue management algorithm for TCP traffic in Internet gateways where different maximum transfer units (MTU...