Sciweavers

552 search results - page 71 / 111
» Constrained Shortest Path Computation
Sort
View
GIS
2006
ACM
15 years 10 months ago
Exploiting a page-level upper bound for multi-type nearest neighbor queries
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
Xiaobin Ma, Shashi Shekhar, Hui Xiong, Pusheng Zha...
ICRA
2009
IEEE
164views Robotics» more  ICRA 2009»
15 years 4 months ago
Assigning cameras to subjects in video surveillance systems
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
Hazem El-Alfy, David Jacobs, Larry Davis
PODC
2004
ACM
15 years 3 months ago
On the expected payment of mechanisms for task allocation
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
Artur Czumaj, Amir Ronen
75
Voted
BROADNETS
2005
IEEE
15 years 3 months ago
Optimal path selection for ethernet over SONET under inaccurate link-state information
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
Satyajeet Ahuja, Marwan Krunz, Turgay Korkmaz
IJRR
2007
104views more  IJRR 2007»
14 years 9 months ago
Deep Space Formation Flying Spacecraft Path Planning
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
Cornel Sultan, Sanjeev Seereeram, Raman K. Mehra