Sciweavers

2020 search results - page 270 / 404
» Speeding up Slicing
Sort
View
ECOOP
1999
Springer
14 years 2 months ago
Dynamic Query-Based Debugging
Program errors are hard to find because of the cause-effect gap between the time when an error occurs and the time when the error becomes apparent to the programmer. Although debu...
Raimondas Lencevicius, Urs Hölzle, Ambuj K. S...
MICRO
1999
IEEE
108views Hardware» more  MICRO 1999»
14 years 2 months ago
Exploiting ILP in Page-based Intelligent Memory
This study compares the speed, area, and power of di erent implementations of Active Pages OCS98], an intelligent memory system which helps bridge the growing gap between processo...
Mark Oskin, Justin Hensley, Diana Keen, Frederic T...
EWLR
1999
Springer
14 years 2 months ago
Toward Seamless Transfer from Simulated to Real Worlds: A Dynamically-Rearranging Neural Network Approach
In the field of evolutionary robotics artificial neural networks are often used to construct controllers for autonomous agents, because they have useful properties such as the ab...
Peter Eggenberger, Akio Ishiguro, Seiji Tokura, To...
IPPS
1998
IEEE
14 years 2 months ago
Rendering Computer Animations on a Network of Workstations
Rendering high-quality computer animations requires intensive computation, and therefore a large amount of time. One way to speed up this process is to devise rendering algorithms...
Timothy D. Davis, Edward W. Davis
IPPS
1998
IEEE
14 years 2 months ago
Locality Optimization for Program Instances
Abstract. The degree of locality of a program re ects the level of temporal and spatial concentration of related data and computations. Locality optimization can speed up programs ...
Claudia Leopold