3656 search results - page 136 / 732 » Compact Location Problems |
95
Voted
PLDI
2010
ACM
15 years 10 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
97
Voted
GLOBECOM
2006
IEEE
15 years 6 months ago
2006
IEEE
— In Mobile Ad Hoc Networks (MANETs), the hidden and the exposed terminal problems affect the throughput of the Medium Access Control (MAC) protocols. Several MAC schemes have be...
IUI
2005
ACM
15 years 6 months ago
2005
ACM
Pinpoint is a promising first step towards using a rich model of task context in proactive and dynamic IR systems. Pinpoint allows a user to navigate decision tree representations...
80
Voted
FOCS
1998
IEEE
15 years 5 months ago
1998
IEEE
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
119
Voted
JAL
2006
15 years 23 days ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...