Sciweavers

1921 search results - page 221 / 385
» Making AC-3 an Optimal Algorithm
Sort
View
GECCO
2007
Springer
201views Optimization» more  GECCO 2007»
16 years 17 days ago
A parallel framework for loopy belief propagation
There are many innovative proposals introduced in the literature under the evolutionary computation field, from which estimation of distribution algorithms (EDAs) is one of them....
Alexander Mendiburu, Roberto Santana, Jose Antonio...
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
15 years 7 months ago
Informative sampling for large unbalanced data sets
Selective sampling is a form of active learning which can reduce the cost of training by only drawing informative data points into the training set. This selected training set is ...
Zhenyu Lu, Anand I. Rughani, Bruce I. Tranmer, Jos...
GECCO
2008
Springer
184views Optimization» more  GECCO 2008»
15 years 7 months ago
Analysis of mammography reports using maximum variation sampling
A genetic algorithm (GA) was developed to implement a maximum variation sampling technique to derive a subset of data from a large dataset of unstructured mammography reports. It ...
Robert M. Patton, Barbara G. Beckerman, Thomas E. ...
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
16 years 17 days ago
Methodology to select solutions from the pareto-optimal set: a comparative study
The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, t...
José C. Ferreira, Carlos M. Fonseca, Ant&oa...
LCTRTS
2004
Springer
15 years 11 months ago
Finding effective compilation sequences
Most modern compilers operate by applying a fixed, program-independent sequence of optimizations to all programs. Compiler writers choose a single “compilation sequence”, or ...
L. Almagor, Keith D. Cooper, Alexander Grosul, Tim...