Sciweavers

3678 search results - page 197 / 736
» On the Stable Paths Problem
Sort
View
JALC
2002
97views more  JALC 2002»
15 years 3 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
ICDE
2006
IEEE
137views Database» more  ICDE 2006»
16 years 5 months ago
Finding Fastest Paths on A Road Network with Speed Patterns
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP ...
Evangelos Kanoulas, Yang Du, Tian Xia, Donghui Zha...
CEC
2008
IEEE
15 years 10 months ago
Path optimization for multiple objectives in directed graphs using genetic algorithms
Abstract— This paper presents a genetic algorithmic approach for finding efficient paths in directed graphs when optimizing multiple objectives. Its aim is to provide solutions...
Juan Rada, Ruben Parma, Wilmer Pereira
IROS
2008
IEEE
151views Robotics» more  IROS 2008»
15 years 10 months ago
Transition-based RRT for path planning in continuous cost spaces
This paper presents a new method called Transition-based RRT (T-RRT) for path planning problems in continuous cost spaces. It combines the exploration strength of the RRT algorith...
Leonard Jaillet, Juan Cortés, Thierry Sim&e...
VTC
2008
IEEE
239views Communications» more  VTC 2008»
15 years 10 months ago
Cross-Layer and Path Priority Scheduling Based Real-Time Video Communications over Wireless Sensor Networks
—This paper addresses the problem of real-time video streaming over a bandwidth and energy constrained wireless sensor network (WSN). Considering the compressed video bit stream ...
Min Chen, Victor C. M. Leung, Shiwen Mao, Ming Li