Sciweavers

7519 search results - page 1410 / 1504
» Optimizing Generic Functions
Sort
View
ASPLOS
1996
ACM
15 years 6 months ago
Shasta: A Low Overhead, Software-Only Approach for Supporting Fine-Grain Shared Memory
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...
Daniel J. Scales, Kourosh Gharachorloo, Chandramoh...
SPAA
1996
ACM
15 years 6 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
VLDB
1997
ACM
78views Database» more  VLDB 1997»
15 years 6 months ago
Recovering Information from Summary Data
Data is often stored in summarized form, as a histogram of aggregates (COUNTs, SUMs, or AVeraGes) over speci ed ranges. We study how to estimate the original detail data from the ...
Christos Faloutsos, H. V. Jagadish, Nikolaos Sidir...
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 6 months ago
Crossover: the divine afflatus in search
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
David Iclanzan
ESTIMEDIA
2006
Springer
15 years 6 months ago
Design of a WCET-Aware C Compiler
This paper presents techniques to tightly integrate worstcase execution time (WCET) information into a compiler framework. Currently, a tight integration of WCET information into ...
Heiko Falk, Paul Lokuciejewski, Henrik Theiling
« Prev « First page 1410 / 1504 Last » Next »