Sciweavers

213 search results - page 26 / 43
» A comparison of search heuristics for empirical code optimiz...
Sort
View
CGO
2008
IEEE
15 years 5 months ago
Cole: compiler optimization level exploration
Modern compilers implement a large number of optimizations which all interact in complex ways, and which all have a different impact on code quality, compilation time, code size,...
Kenneth Hoste, Lieven Eeckhout
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 5 months ago
On the behavioral diversity of random programs
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
Moshe Looks
EPS
1998
Springer
15 years 3 months ago
Evolutionary Algorithms for Vertex Cover
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...
Isaac K. Evans
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
15 years 4 months ago
Transition models as an incremental approach for problem solving in evolutionary algorithms
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...
CORR
2006
Springer
96views Education» more  CORR 2006»
14 years 11 months ago
Upper Bounding the Performance of Arbitrary Finite LDPC Codes on Binary Erasure Channels
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...
Chih-Chun Wang, Sanjeev R. Kulkarni, H. Vincent Po...