Sciweavers

12825 search results - page 2035 / 2565
» Improved PLSOM algorithm
Sort
View
SC
2000
ACM
15 years 10 months ago
Tiling Optimizations for 3D Scientific Computations
Compiler transformations can significantly improve data locality for many scientific programs. In this paper, we show iterative solvers for partial differential equations (PDEs) i...
Gabriel Rivera, Chau-Wen Tseng
SIGGRAPH
2000
ACM
15 years 10 months ago
Pose space deformation: a unified approach to shape interpolation and skeleton-driven deformation
Pose space deformation generalizes and improves upon both shape interpolation and common skeleton-driven deformation techniques. This deformation approach proceeds from the observ...
John P. Lewis, Matt Cordner, Nickson Fong
PARLE
1994
15 years 10 months ago
Run-Time Optimization of Sparse Matrix-Vector Multiplication on SIMD Machines
Sparse matrix-vector multiplication forms the heart of iterative linear solvers used widely in scientific computations (e.g., finite element methods). In such solvers, the matrix-v...
Louis H. Ziantz, Can C. Özturan, Boleslaw K. ...
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
15 years 10 months ago
Robust symbolic regression with affine arithmetic
We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze e...
Cassio Pennachin, Moshe Looks, João A. de V...
AIPS
2007
15 years 9 months ago
Prioritizing Bellman Backups without a Priority Queue
Several researchers have shown that the efficiency of value iteration, a dynamic programming algorithm for Markov decision processes, can be improved by prioritizing the order of...
Peng Dai, Eric A. Hansen
« Prev « First page 2035 / 2565 Last » Next »