Sciweavers

1725 search results - page 5 / 345
» Relaxed genetic programming
Sort
View
EUROGP
2008
Springer
137views Optimization» more  EUROGP 2008»
14 years 11 months ago
A Comparison of Cartesian Genetic Programming and Linear Genetic Programming
Two prominent genetic programming approaches are the graph-based Cartesian Genetic Programming (CGP) and Linear Genetic Programming (LGP). Recently, a formal algorithm for construc...
Garnett Carl Wilson, Wolfgang Banzhaf
FCT
2003
Springer
15 years 2 months ago
Proving Integrality Gaps without Knowing the Linear Program
: Proving integrality gaps for linear relaxations of NP optimization problems is a difficult task and usually undertaken on a case-by-case basis. We initiate a more systematic app...
Sanjeev Arora
POPL
2009
ACM
15 years 10 months ago
Relaxed memory models: an operational approach
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
Gérard Boudol, Gustavo Petri
JIKM
2006
136views more  JIKM 2006»
14 years 9 months ago
Decision Support Systems Using Ensemble Genetic Programming
Abstract. This paper proposes a decision support system for tactical air combat environment using a combination of unsupervised learning for clustering the data and an ensemble of ...
Ajith Abraham, Crina Grosan
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
15 years 2 months ago
Ant Colony Programming for Approximation Problems
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wiec...