Sciweavers

185 search results - page 21 / 37
» Experimental Study of Compiler Techniques for NUMA Machines
Sort
View
CGO
2005
IEEE
15 years 5 months ago
Optimizing Sorting with Genetic Algorithms
The growing complexity of modern processors has made the generation of highly efficient code increasingly difficult. Manual code generation is very time consuming, but it is oft...
Xiaoming Li, María Jesús Garzar&aacu...
GECCO
2009
Springer
166views Optimization» more  GECCO 2009»
15 years 6 months ago
Genetic programming in the wild: evolving unrestricted bytecode
We describe a methodology for evolving Java bytecode, enabling the evolution of extant, unrestricted Java programs, or programs in other languages that compile to Java bytecode. B...
Michael Orlov, Moshe Sipper
IPPS
2007
IEEE
15 years 6 months ago
POET: Parameterized Optimizations for Empirical Tuning
The excessive complexity of both machine architectures and applications have made it difficult for compilers to statically model and predict application behavior. This observatio...
Qing Yi, Keith Seymour, Haihang You, Richard W. Vu...
JMLR
2007
101views more  JMLR 2007»
14 years 11 months ago
Noise Tolerant Variants of the Perceptron Algorithm
A large number of variants of the Perceptron algorithm have been proposed and partially evaluated in recent work. One type of algorithm aims for noise tolerance by replacing the l...
Roni Khardon, Gabriel Wachman
CASES
2009
ACM
15 years 6 months ago
Tight WCRT analysis of synchronous C programs
Accurate estimation of the tick length of a synchronous program is essential for efficient and predictable implementations that are devoid of timing faults. The techniques to dete...
Partha S. Roop, Sidharta Andalam, Reinhard von Han...