Sciweavers

411 search results - page 45 / 83
» Automatically finding patches using genetic programming
Sort
View
PLDI
1996
ACM
14 years 2 months ago
Fast, Effective Dynamic Compilation
Dynamic compilation enables optimizations based on the values of invariant data computed at run-time. Using the values of these runtime constants, a dynamic compiler can eliminate...
Joel Auslander, Matthai Philipose, Craig Chambers,...
GECCO
2004
Springer
110views Optimization» more  GECCO 2004»
14 years 3 months ago
Using GP to Model Contextual Human Behavior
To create a realistic environment, some simulations require simulated agents with human behavior pattern. Creating such agents with realistic behavior can be a tedious and time con...
Hans Fernlund, Avelino J. Gonzalez
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
14 years 3 months ago
Preventing overfitting in GP with canary functions
Overfitting is a fundamental problem of most machine learning techniques, including genetic programming (GP). Canary functions have been introduced in the literature as a concept ...
Nate Foreman, Matthew P. Evett
TMI
2002
191views more  TMI 2002»
13 years 9 months ago
Automatic Detection of Abnormalities in Chest Radiographs Using Local Texture Analysis
A fully automatic method is presented to detect abnormalities in frontal chest radiographs which are aggregated into an overall abnormality score. The method is aimed at finding ab...
Bram van Ginneken, Shigehiko Katsuragawa, Bart M. ...
PRL
2006
139views more  PRL 2006»
13 years 9 months ago
Evolving color constancy
Objects retain their color in spite of changes in the wavelength and energy composition of the light they reflect. This phenomenon is called color constancy and plays an important ...
Marc Ebner