1594 search results - page 45 / 319 » An Algorithm to Compute Collusion Paths |
ICRA
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper proposes a novel path planning algorithm of 3-D articulated robots with moving bases based on a generalized potential field model. The approach computes, similar to th...
110
click to vote
PG
2000
IEEE
15 years 4 months ago
2000
IEEE
This paper describes a two pass algorithm capable of computing solutions to the global illumination in general environments (diffuse or glossy surfaces, anisotropically scattering...
ACMSE
2006
ACM
15 years 5 months ago
2006
ACM
This paper considers the design of a camera path through a scene. Given a valid set of keyframes for the camera, we want to build a camera path that avoids collisions with the sce...
FOCS
1992
IEEE
15 years 3 months ago
1992
IEEE
Abstract Summary of results The subcubic (O(n ) for < 3) algorithms to multiply Boolean matrices do not provide the witnesses; namely, they compute C = AB but if Cij = 1 they d...
SWAT
1998
Springer
15 years 4 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...