103 search results - page 12 / 21 » The Cover Time of Random Digraphs |
FDL
2008
IEEE
14 years 2 months ago
2008
IEEE
Constraint-based random simulation is state-of-the-art in verification of multi-million gate industrial designs. This method is based on stimulus generation by constraint solving...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
IJWIN
2006
13 years 7 months ago
2006
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
SIGECOM
2000
ACM
14 years 3 days ago
2000
ACM
Using data collected between August 1999 and January 2000, we examine firm-level pricing strategies for 32 online bookstores. The data cover more than 300 books, including New Yor...
AHSWN
2008
13 years 8 months ago
2008
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...