Sciweavers

344 search results - page 47 / 69
» An abstraction-based genetic programming system
Sort
View
RTA
2007
Springer
15 years 4 months ago
Rewriting Approximations for Fast Prototyping of Static Analyzers
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luk...
GECCO
2005
Springer
135views Optimization» more  GECCO 2005»
15 years 3 months ago
Parameter sweeps for exploring GP parameters
This paper describes our procedure and a software application for conducting large parameter sweep experiments in genetic and evolutionary computation research. Both procedure and...
Michael E. Samples, Jason M. Daida, Matthew J. Byo...
PLDI
2004
ACM
15 years 3 months ago
Fast searches for effective optimization phase sequences
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
Prasad Kulkarni, Stephen Hines, Jason Hiser, David...
EUROGP
2007
Springer
143views Optimization» more  EUROGP 2007»
15 years 1 months ago
Confidence Intervals for Computational Effort Comparisons
Abstract. When researchers make alterations to the genetic programming algorithm they almost invariably wish to measure the change in performance of the evolutionary system. No one...
Matthew Walker, Howard Edwards, Chris H. Messom
PPSN
1998
Springer
15 years 2 months ago
Methods to Evolve Legal Phenotypes
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints c...
Tina Yu, Peter J. Bentley