Sciweavers

1725 search results - page 7 / 345
» Relaxed genetic programming
Sort
View
POPL
2006
ACM
14 years 7 months ago
N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems
Albert Cohen, Marc Duranton, Christine Eisenbeis, ...
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
14 years 7 months ago
Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut
We study linear programming relaxations of Vertex Cover and Max Cut arising from repeated applications of the "lift-and-project" method of Lovasz and Schrijver starting ...
Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
13 years 11 months ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...
ICGA
1997
126views Optimization» more  ICGA 1997»
13 years 9 months ago
Evolution of Graph-Like Programs with Parallel Distributed Genetic Programming
Parallel Distributed Genetic Programming (PDGP) is a new form of Genetic Programming (GP) suitable for the development of programs with a high degree of parallelism. Programs are ...
Riccardo Poli
AIR
2004
130views more  AIR 2004»
13 years 7 months ago
A Hybrid Framework for Over-Constrained Generalized
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...