Sciweavers

4469 search results - page 426 / 894
» Dynamic Program Slicing
Sort
View
IPPS
1999
IEEE
15 years 11 months ago
Application Performance of a Linux Cluster Using Converse
Abstract. Clusters of PCs are an attractive platform for parallel applications because of their cost effectiveness. We have implemented an interoperable runtime system called Conve...
Laxmikant V. Kalé, Robert Brunner, James C....
SIGGRAPH
1994
ACM
15 years 11 months ago
Fast contact force computation for nonpenetrating rigid bodies
A new algorithm for computing contact forces between solid objects with friction is presented. The algorithm allows a mix of contact points with static and dynamic friction. In co...
David Baraff
IMS
2000
125views Hardware» more  IMS 2000»
15 years 10 months ago
Compiler-Directed Cache Line Size Adaptivity
The performance of a computer system is highly dependent on the performance of the cache memory system. The traditional cache memory system has an organization with a line size tha...
Dan Nicolaescu, Xiaomei Ji, Alexander V. Veidenbau...
IWMM
2000
Springer
144views Hardware» more  IWMM 2000»
15 years 10 months ago
Memory Allocation with Lazy Fits
Dynamic memory allocation is an important part of modern programming languages. It is important that it be done fast without wasting too much memory. Memory allocation using lazy ...
Yoo C. Chung, Soo-Mook Moon
AGI
2008
15 years 8 months ago
Anticipative coordinated cognitive processes for interactivist and Piagetian theories
Abstract. This paper presents a model of intelligence based on principles introduced by Piaget and the interactivist framework. It focuses on embodiment and sensory-motor aspects o...
Jean-Charles Quinton, Jean-Christophe Buisson, Fil...