1093 search results - page 69 / 219 » Probabilistic Location and Routing |
130
Voted
CJ
2002
15 years 3 months ago
2002
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
ICRA
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— This paper describes a probabilistic bail-out condition for multihypothesis testing based on Bennett’s inequality. We investigate the use of the test for increasing t...
125
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this paper we study a variation of the Dynamic Traveling Repairperson Problem (DTRP) in which there are two classes of demands; high priority, and low priority. In the probl...
143
Voted
ICDT
1999
ACM
15 years 7 months ago
1999
ACM
Abstract. In this paper we consider databases representing information about moving objects (e.g. vehicles), particularly their location. We address the problems of updating and qu...
124
Voted
VLSID
2002
IEEE
16 years 4 months ago
2002
IEEE
We describe a new algorithm for floorplan evaluation using timing-driven buffered routing according to a prescribed buffer site map. Specifically, we describe a provably good mult...