1594 search results - page 98 / 319 » An Algorithm to Compute Collusion Paths |
156
click to vote
CORR
2010
Springer
15 years 16 days ago
2010
Springer
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
116
click to vote
CCCG
1996
15 years 4 months ago
1996
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
107
Voted
FOCM
2002
15 years 2 months ago
2002
We consider the Riemannian geometry defined on a convex set by the Hessian of a selfconcordant barrier function, and its associated geodesic curves. These provide guidance for the...
123
click to vote
JUCS
2010
15 years 1 months ago
2010
: We prove that two conditions are sufficient, and with three exceptions also necessary, for reachability of any position in restricted walk on integers in which the sizes of the m...
103
click to vote
CN
2007
15 years 3 months ago
2007
Determining an appropriate sending rate when beginning data transmission into a network with unknown characteristics is a fundamental issue in best-effort networks. Traditionally,...