260 search results - page 36 / 52 » Range and Set Abstraction using SAT |
ENTCS
2006
13 years 7 months ago
2006
nary abstract) Jan Friso Groote 1 MohammadReza Mousavi 2 Michel A. Reniers 3 Department of Computer Science, Eindhoven University of Technology (TU/e), P.O. Box 513, NL-5600 MB Ein...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--In the majority of studies on CSMA wireless networks, a contention graph is used to model the carrier sensing relationships among links. This is a 0-1 model in which two ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
BIRTHDAY
2010
Springer
14 years 20 days ago
2010
Springer
Abstract. Database preprocessing in order to create an index often permits considerable speedup in search compared to the iterated query of an unprocessed database. In this paper w...
ASE
2004
13 years 7 months ago
2004
er is concerned with an abstract exploration of code mobility constructs designed for use in settings where the level of granularity associated with the mobile units exhibits sign...