2796 search results - page 355 / 560 » The coolest path problem |
208
click to vote
AAIM
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
178
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
A practical lipreading system can be considered either as subject dependent (SD) or subject-independent (SI). An SD system is user-specific, i.e., customized for some particular ...
334
click to vote
ADHOC
2011
15 years 1 months ago
2011
One of the intrinsic problems of mobility in wireless networks is the discovery of mobile nodes. A widely used solution for this problem is to use different variations of beacons, ...
203
click to vote
TON
2012
13 years 9 months ago
2012
—Multiparty interactive network applications such as teleconferencing, network gaming, and online trading are gaining popularity. In addition to end-to-end latency bounds, these ...
176
click to vote
DAM
2008
15 years 6 months ago
2008
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...