Sciweavers

599 search results - page 97 / 120
» The traveling salesman problem
Sort
View
DCOSS
2007
Springer
13 years 11 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
13 years 6 months ago
Beyond isolation: research opportunities in declarative data-driven coordination
There are many database applications that require users to coordinate and communicate. Friends want to coordinate travel plans, students want to jointly enroll in the same set of ...
Lucja Kot, Nitin Gupta 0003, Sudip Roy, Johannes G...
EOR
2011
85views more  EOR 2011»
13 years 2 months ago
Optimizing departure times in vehicle routes
Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporal traffic co...
A. L. Kok, E. W. Hans, J. M. J. Schutten
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
14 years 9 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
GIS
2009
ACM
14 years 9 months ago
An Interactive Approach to Route Search
A route leads from a start location to a final destination and passes through geospatial entities that are picked according to search terms provided by the user. Each entity is pe...
Yaron Kanza, Roy Levin, Eliyahu Safra, Yehoshua Sa...