3678 search results - page 187 / 736 » On the Stable Paths Problem |
147
Voted
IPL
2008
15 years 3 months ago
2008
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
223
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
142
click to vote
IFM
2009
Springer
15 years 10 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
140
click to vote
SOCO
2007
Springer
15 years 10 months ago
2007
Springer
Aspects require access to the join point context in order to select and adapt join points. For this purpose, current aspect-oriented systems offer a large number of pointcut constr...
112
Voted
WADS
2007
Springer
15 years 10 months ago
2007
Springer
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...