170 search results - page 5 / 34 » A Bounding Quantifier |
SAT
2005
Springer
14 years 27 days ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
ICASSP
2008
IEEE
14 years 1 months ago
2008
IEEE
We attempt to quantify the possible gains that can be achieved by examining a rate-distortion competition between a conventional and a compressive sampling solution to data rate r...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—This paper investigates the speed limit of information propagation in large wireless networks, which provides fundamental understanding of the fastest information transp...
PAMI
2006
13 years 7 months ago
2006
A visual search is required when applying a recognition process on a scene containing multiple objects. In such cases, we would like to avoid an exhaustive sequential search. This...