Sciweavers

1594 search results - page 45 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
ICRA
2003
IEEE
122views Robotics» more  ICRA 2003»
15 years 8 months ago
A novel potential-based path planning of 3-D articulated robots with moving bases
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...
Chien-Chou Lin, Chi-Chun Pan, Jen-Hui Chuang
139
Voted
PG
2000
IEEE
15 years 7 months ago
Acceleration of Monte Carlo Path Tracing in General Environments
This paper describes a two pass algorithm capable of computing solutions to the global illumination in general environments (diffuse or glossy surfaces, anisotropically scattering...
Frederic Pérez, Ignacio Martín, Xavi...
120
Voted
ACMSE
2006
ACM
15 years 8 months ago
Controlling the entire path of a virtual camera
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...
Ross Ptacek, John K. Johnstone
93
Voted
FOCS
1992
IEEE
15 years 6 months ago
Witnesses for Boolean Matrix Multiplication and for Shortest Paths
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...
Noga Alon, Zvi Galil, Oded Margalit, Moni Naor
109
Voted
SWAT
1998
Springer
108views Algorithms» more  SWAT 1998»
15 years 6 months ago
Formal Language Constrained Path Problems
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 ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...