Sciweavers

594 search results - page 74 / 119
» Travelling Miser Problem
Sort
View
GIS
2003
ACM
14 years 9 months ago
Processing in-route nearest neighbor queries: a comparison of alternative approaches
Nearest neighbor query is one of the most important operations in spatial databases and their application domains, e.g., locationbased services, advanced traveler information syst...
Shashi Shekhar, Jin Soung Yoo
SDM
2009
SIAM
117views Data Mining» more  SDM 2009»
14 years 5 months ago
Spatially Cost-Sensitive Active Learning.
In active learning, one attempts to maximize classifier performance for a given number of labeled training points by allowing the active learning algorithm to choose which points...
Alexander Liu, Goo Jun, Joydeep Ghosh
WINE
2009
Springer
184views Economy» more  WINE 2009»
14 years 2 months ago
Competitive Routing over Time
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
Martin Hoefer, Vahab S. Mirrokni, Heiko Rögli...
ICRA
2003
IEEE
167views Robotics» more  ICRA 2003»
14 years 1 months ago
Local exploration: online algorithms and a probabilistic framework
— Mapping an environment with an imaging sensor becomes very challenging if the environment to be mapped is unknown and has to be explored. Exploration involves the planning of v...
Volkan Isler, Sampath Kannan, Kostas Daniilidis
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
14 years 1 months ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...