3678 search results - page 224 / 736 » On the Stable Paths Problem |
214
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
190
click to vote
GD
2007
Springer
16 years 1 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
180
click to vote
IROS
2006
IEEE
16 years 1 months ago
2006
IEEE
– We consider a search for a target moving within a known indoor environment partitioned into interconnected regions of varying sizes. The knowledge of target location is describ...
162
click to vote
IJCAI
2003
15 years 8 months ago
2003
We solve the problem of obtaining answers to queries posed to a mediated integration system un der the local-as-view paradigm that are consistent wrt to certain global integrity...
186
click to vote
ISVD
2007
IEEE
16 years 1 months ago
2007
IEEE
We consider the problem of computing the time convex hull of a set of points in the presence of a straight-line highway in the plane. The traveling speed in the plane is assumed t...