Sciweavers

411 search results - page 3 / 83
» Automatically finding patches using genetic programming
Sort
View
EVOW
2006
Springer
13 years 9 months ago
Finding Compact BDDs Using Genetic Programming
Binary Decision Diagrams (BDDs) can be used to design multiplexor based circuits. Unfortunately, the most commonly used kind of BDDs
Ulrich Kühne, Nicole Drechsler
GECCO
2008
Springer
116views Optimization» more  GECCO 2008»
13 years 6 months ago
Finding deadlocks in large concurrent Java programs using genetic algorithms
Enrique Alba, J. Francisco Chicano, Marco Ferreira...
GPEM
2000
126views more  GPEM 2000»
13 years 5 months ago
Automatic Creation of Human-Competitive Programs and Controllers by Means of Genetic Programming
Genetic programming is an automatic method for creating a computer program or other complex structure to solve a problem. This paper first reviews various instances where genetic p...
John R. Koza, Martin A. Keane, Jessen Yu, Forrest ...
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
13 years 10 months ago
Evolution, development and learning using self-modifying cartesian genetic programming
Self-Modifying Cartesian Genetic Programming (SMCGP) is a form of genetic programming that integrates developmental (self-modifying) features as a genotype-phenotype mapping. This...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
TON
2008
103views more  TON 2008»
13 years 5 months ago
On the race of worms, alerts, and patches
We study the effectiveness of automatic patching and quantify the speed of patch or alert dissemination required for worm containment. We focus on random scanning as this is repres...
Milan Vojnovic, Ayalvadi J. Ganesh