552 search results - page 79 / 111 » Constrained Shortest Path Computation |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
JITE
2006
14 years 9 months ago
2006
learning abstract computer concepts. In addition, visualization helps novices construct a mental model of concepts, which is pivotal to further comprehension and understanding. Sec...
90
Voted
ICRA
2008
IEEE
15 years 4 months ago
2008
IEEE
— An important problem in position-based visual servoing (PBVS) is to guarantee that a target will remain within the field of view for the duration of the task. In this paper, w...
74
Voted
ICRA
2003
IEEE
15 years 2 months ago
2003
IEEE
— We present an O(n log1+ε n)-time algorithm for computing the optimal robot motion that maintains lineof-sight visibility between a target moving inside a polygon with n vertic...
PODS
1991
ACM
15 years 1 months ago
1991
ACM
A novel approach is proposed for ezpresaing and computing eficienily a large cla88 of problem8, including jinding the shortest path in a graph, that were previously considered imp...