Sciweavers

2479 search results - page 299 / 496
» A Computational Theory of Working Memory
Sort
View
PLDI
1996
ACM
15 years 10 months ago
Fast, Effective Dynamic Compilation
Dynamic compilation enables optimizations based on the values of invariant data computed at run-time. Using the values of these runtime constants, a dynamic compiler can eliminate...
Joel Auslander, Matthai Philipose, Craig Chambers,...
CHI
1994
ACM
15 years 10 months ago
User learning and performance with marking menus
A marking menu is designed to allow a user to perform a menu selection by either popping-up a radial (or pie) menu, or by making a straight mark in the direction of the desired me...
Gordon Kurtenbach, William Buxton
ICS
1994
Tsinghua U.
15 years 10 months ago
Compiler and runtime support for out-of-core HPF programs
This paper describes the design of a compiler which can translate out-of-core programs written in a data parallel language like HPF. Such a compiler is required for compiling larg...
Rajeev Thakur, Rajesh Bordawekar, Alok N. Choudhar...
PPSN
1992
Springer
15 years 10 months ago
Nonstationary Function Optimization using the Structured Genetic Algorithm
In this paper, we describe the application of a new type of genetic algorithm called the Structured Genetic Algorithm (sGA) for function optimization in nonstationary environments...
Dipankar Dasgupta, Douglas R. McGregor
CF
2007
ACM
15 years 10 months ago
Speculative supplier identification for reducing power of interconnects in snoopy cache coherence protocols
In this work we reduce interconnect power dissipation in Symmetric Multiprocessors or SMPs. We revisit snoopy cache coherence protocols and reduce unnecessary interconnect activit...
Ehsan Atoofian, Amirali Baniasadi, Kaveh Aasaraai