Sciweavers

3678 search results - page 109 / 736
» On the Stable Paths Problem
Sort
View
80
Voted
JCSS
2000
71views more  JCSS 2000»
15 years 17 days ago
Path Constraints in Semistructured Databases
We investigate a class of path constraints that is of interest in connection with both semistructured and structured data. In standard database systems, constraints are typically ...
Peter Buneman, Wenfei Fan, Scott Weinstein
COCOON
2011
Springer
14 years 17 days ago
Finding Paths with Minimum Shared Edges
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Masoud T. Omran, Jörg-Rüdiger Sack, Hami...
EOR
2002
68views more  EOR 2002»
15 years 17 days ago
The computational complexity of the criticality problems in a network with interval activity times
The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) ...
Stefan Chanas, Pawel Zielinski
108
Voted
ICRA
2009
IEEE
161views Robotics» more  ICRA 2009»
15 years 7 months ago
Multi-vehicle path planning in dynamically changing environments
— In this paper, we propose a path planning method for nonholonomic multi-vehicle system in presence of moving obstacles. The objective is to find multiple fixed length paths f...
Ali Ahmadzadeh, Nader Motee, Ali Jadbabaie, George...
77
Voted
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
15 years 2 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska