Sciweavers

895 search results - page 176 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
SIAMJO
2002
92views more  SIAMJO 2002»
13 years 7 months ago
Generalized Bundle Methods
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
Antonio Frangioni
KDD
2009
ACM
178views Data Mining» more  KDD 2009»
14 years 8 months ago
Constrained optimization for validation-guided conditional random field learning
Conditional random fields(CRFs) are a class of undirected graphical models which have been widely used for classifying and labeling sequence data. The training of CRFs is typicall...
Minmin Chen, Yixin Chen, Michael R. Brent, Aaron E...
TJS
2002
160views more  TJS 2002»
13 years 7 months ago
Adaptive Optimizing Compilers for the 21st Century
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
Keith D. Cooper, Devika Subramanian, Linda Torczon
GECCO
2008
Springer
239views Optimization» more  GECCO 2008»
13 years 8 months ago
Multiobjective design of operators that detect points of interest in images
In this paper, a multiobjective (MO) learning approach to image feature extraction is described, where Pareto-optimal interest point (IP) detectors are synthesized using genetic p...
Leonardo Trujillo, Gustavo Olague, Evelyne Lutton,...
CSDA
2008
128views more  CSDA 2008»
13 years 7 months ago
Classification tree analysis using TARGET
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
J. Brian Gray, Guangzhe Fan