Sciweavers

3678 search results - page 171 / 736
» On the Stable Paths Problem
Sort
View
134
Voted
PVLDB
2010
269views more  PVLDB 2010»
15 years 2 months ago
Shortest Path Computation on Air Indexes
Shortest path computation is one of the most common queries in location-based services that involve transportation networks. Motivated by scalability challenges faced in the mobil...
Georgios Kellaris, Kyriakos Mouratidis
147
Voted
FQAS
2009
Springer
127views Database» more  FQAS 2009»
15 years 10 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
127
Voted
COMPSAC
2008
IEEE
15 years 10 months ago
Constraint Reasoning in Path-Oriented Random Testing
Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that activate a single control flow path within an imperative program. T...
Arnaud Gotlieb, Matthieu Petit
182
Voted
ROBOCOMM
2007
IEEE
15 years 10 months ago
Path planning using Shi and Karl level sets
—Path planning for mobile robots is a well researched problem for over three decades. In this paper, we test and evaluate a new approach based on Shi and Karl Level Sets for mobi...
Randeep Singh, Nagaraju Bussa
114
Voted
ICRA
1993
IEEE
104views Robotics» more  ICRA 1993»
15 years 7 months ago
Numerical Determination of Optimal Non-Holonomic Paths in the Presence of Obstacles
This paper addresses the problem of numerically finding an optimal path for a robot with non-holonomic constraints. A car like robot, whose turning radius is lower bounded is cons...
Sudhaker Samuel, S. Sathiya Keerthi