599 search results - page 111 / 120 » The traveling salesman problem |
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
ICDE
2005
IEEE
14 years 9 months ago
2005
IEEE
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
ICS
2010
Tsinghua U.
14 years 5 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
CIAC
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
PRL
2006
13 years 7 months ago
2006
This paper considers the problem of designing an active observer to plan a sequence of decisions regarding what target to look at, through a foveal-sensing action. We propose a fr...