4894 search results - page 848 / 979 » The Guarding Problem - Complexity and Approximation |
KI
1997
Springer
14 years 2 days ago
1997
Springer
One of the fundamental problems in the eld of mobile robotics is the estimation of the robot's position in the environment. Position probability grids have been proven to be a...
ISCA
1994
IEEE
14 years 1 days ago
1994
IEEE
This paper presents an examination of different cache and processor configurations assuming transistor densities will continue to increase as they have in the past. While in the s...
PLILP
1993
Springer
14 years 11 hour ago
1993
Springer
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
SIGGRAPH
1993
ACM
14 years 6 hour ago
1993
ACM
We introduce a new approach for the computation of viewindependent solutions to the diffuse global illumination problem in polyhedral environments. The approach combines ideas fro...
AFRIGRAPH
2009
ACM
13 years 12 months ago
2009
ACM
Traditionally, levels of detail (LOD) for animated characters are computed from a single pose. Later techniques refined this approach by considering a set of sample poses and eval...