Sciweavers

2157 search results - page 184 / 432
» Optimal Fast Hashing
Sort
View
PE
2000
Springer
118views Optimization» more  PE 2000»
15 years 4 months ago
A probabilistic dynamic technique for the distributed generation of very large state spaces
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...
William J. Knottenbelt, Peter G. Harrison, Mark Me...
CGF
2011
14 years 10 months ago
A Parallel SPH Implementation on Multi-Core CPUs
This paper presents a parallel framework for simulating fluids with the Smoothed Particle Hydrodynamics (SPH) method. For low computational costs per simulation step, efficient ...
Markus Ihmsen, Nadir Akinci, Markus Becker, Matthi...
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
14 years 7 months ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...
TROB
2008
126views more  TROB 2008»
15 years 4 months ago
Online Optimization of Swimming and Crawling in an Amphibious Snake Robot
An important problem in the control of locomotion of robots with multiple degrees of freedom (e.g., biomimetic robots) is to adapt the locomotor patterns to the properties of the e...
Alessandro Crespi, Auke Jan Ijspeert
CLUSTER
2004
IEEE
15 years 8 months ago
Predicting memory-access cost based on data-access patterns
Improving memory performance at software level is more effective in reducing the rapidly expanding gap between processor and memory performance. Loop transformations (e.g. loop un...
Surendra Byna, Xian-He Sun, William Gropp, Rajeev ...