Sciweavers

9626 search results - page 1275 / 1926
» Invariant Based Programming
Sort
View
SC
2005
ACM
16 years 25 days ago
Automatic Tuning of Inlining Heuristics
Inlining improves the performance of programs by reducing the overhead of method invocation and increasing the opportunities for compiler optimization. Incorrect inlining decision...
John Cavazos, Michael F. P. O'Boyle
202
Voted
SC
2005
ACM
16 years 25 days ago
Transformations to Parallel Codes for Communication-Computation Overlap
This paper presents program transformations directed toward improving communication-computation overlap in parallel programs that use MPI’s collective operations. Our transforma...
Anthony Danalis, Ki-Yong Kim, Lori L. Pollock, D. ...
AE
2005
Springer
16 years 25 days ago
Size Control with Maximum Homologous Crossover
Most of the Evolutionary Algorithms handling variable-sized structures, like Genetic Programming, tend to produce too long solutions and the recombination operator used is often co...
Michael Defoin-Platel, Manuel Clergue, Philippe Co...
BERTINORO
2005
Springer
16 years 25 days ago
Evolving Fractal Gene Regulatory Networks for Graceful Degradation of Software
Fractal proteins are an evolvable method of mapping genotype to phenotype through a developmental process, where genes are expressed into proteins comprised of subsets of the Mande...
Peter J. Bentley
217
Voted
CHES
2005
Springer
281views Cryptology» more  CHES 2005»
16 years 25 days ago
Data Remanence in Flash Memory Devices
Data remanence is the residual physical representation of data that has been erased or overwritten. In non-volatile programmable devices, such as UV EPROM, EEPROM or Flash, bits ar...
Sergei P. Skorobogatov
« Prev « First page 1275 / 1926 Last » Next »