Sciweavers

5675 search results - page 938 / 1135
» Exploiting Chaos for Computation
Sort
View
ICRA
2006
IEEE
90views Robotics» more  ICRA 2006»
16 years 1 months ago
A Performance Comparison of Three Algorithms for Proximity Queries Relative to Convex Polyhedra
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
Stefano Carpin, Claudio Mirolo, Enrico Pagello
ICCS
2005
Springer
16 years 20 days ago
Self-optimization of Large Scale Wildfire Simulations
The development of efficient parallel algorithms for large scale wildfire simulations is a challenging research problem because the factors that determine wildfire behavior are com...
Jingmei Yang, Huoping Chen, Salim Hariri, Manish P...
ICS
2001
Tsinghua U.
15 years 11 months ago
Slice-processors: an implementation of operation-based prediction
We describe the Slice Processor micro-architecture that implements a generalized operation-based prefetching mechanism. Operation-based prefetchers predict the series of operation...
Andreas Moshovos, Dionisios N. Pnevmatikatos, Amir...
SIGGRAPH
1997
ACM
15 years 11 months ago
Metropolis light transport
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
Eric Veach, Leonidas J. Guibas
FCCM
2004
IEEE
130views VLSI» more  FCCM 2004»
15 years 11 months ago
Hyperreconfigurable Architectures for Fast Run Time Reconfiguration
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit changing needs of a computation during run time. The increasing...
Sebastian Lange, Martin Middendorf