Sciweavers

19130 search results - page 97 / 3826
» Modelling multi-path problems
Sort
View
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
15 years 11 months ago
Comparing Discrete and Continuous Genotypes on the Constrained Portfolio Selection Problem
In financial engineering the problem of portfolio selection has drawn much attention in the last decades. But still unsolved problems remain, while on the one hand the type of mod...
Felix Streichert, Holger Ulmer, Andreas Zell
CP
2001
Springer
15 years 10 months ago
Partially Ordered Constraint Optimization Problems
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
Marco Gavanelli
ANOR
2005
72views more  ANOR 2005»
15 years 6 months ago
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...
Gary A. Kochenberger, Fred Glover, Bahram Alidaee,...
AUSAI
2004
Springer
15 years 11 months ago
A Learning-Based Algorithm Selection Meta-reasoner for the Real-Time MPE Problem
Abstract. The algorithm selection problem aims to select the best algorithm for an input problem instance according to some characteristics of the instance. This paper presents a l...
Haipeng Guo, William H. Hsu
EUROGP
2007
Springer
145views Optimization» more  EUROGP 2007»
15 years 10 months ago
GP Classifier Problem Decomposition Using First-Price and Second-Price Auctions
This work details an auction-based model for problem decomposition in Genetic Programming classification. The approach builds on the population-based methodology of Genetic Progra...
Peter Lichodzijewski, Malcolm I. Heywood