207 search results - page 8 / 42 » Run-Time Switching Between Total Order Algorithms |
CDC
2009
IEEE
14 years 3 days ago
2009
IEEE
— We consider the problem of determining the existence of known constant signals over a set of sites, given noisy measurements obtained by a team of active sensors that can switc...
DAC
2004
ACM
14 years 8 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
SIGMETRICS
2002
ACM
13 years 7 months ago
2002
ACM
This paper analyzes various algorithms for scheduling low priority disk drive tasks. The derived closed form solution is applicable to class of greedy algorithms that include a va...
SUTC
2006
IEEE
14 years 1 months ago
2006
IEEE
Energy assessment of MAC protocols for wireless sensor networks is generally based on the times of transmit, receive and sleep modes. The switching energy between two consecutive ...
COMGEO
2007
ACM
13 years 7 months ago
2007
ACM
Snap rounding is a method for converting arbitrary-precision arrangements of segments into fixed-precision representation. We present an algorithm for snap rounding with running ...