Sciweavers

707 search results - page 25 / 142
» Solving path problems on the GPU
Sort
View
INFOCOM
2005
IEEE
15 years 5 months ago
Interference-aware routing in multihop wireless networks using directional antennas
— Recent research has shown that interference can make a significant impact on the performance of multihop wireless networks. Researchers have studied interference-aware topolog...
Jian Tang, Guoliang Xue, Christopher Chandler, Wei...
EMMCVPR
2007
Springer
15 years 3 months ago
Efficient Shape Matching Via Graph Cuts
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...
RAS
1998
145views more  RAS 1998»
14 years 11 months ago
Coordinated path planning for multiple robots
We present a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment....
Petr Svestka, Mark H. Overmars
AIPS
2011
14 years 3 months ago
Heuristic Search for Generalized Stochastic Shortest Path MDPs
Research in efficient methods for solving infinite-horizon MDPs has so far concentrated primarily on discounted MDPs and the more general stochastic shortest path problems (SSPs...
Andrey Kolobov, Mausam, Daniel S. Weld, Hector Gef...
EOR
2007
90views more  EOR 2007»
14 years 11 months ago
Arc routing problems with time-dependent service costs
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin