Sciweavers

430 search results - page 15 / 86
» Constructing Dynamic Optimization Test Problems Using the Mu...
Sort
View
EOR
2007
117views more  EOR 2007»
14 years 9 months ago
Approximation of min-max and min-max regret versions of some combinatorial optimization problems
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
GECCO
2009
Springer
193views Optimization» more  GECCO 2009»
15 years 2 months ago
Optimization of dynamic memory managers for embedded systems using grammatical evolution
New portable consumer embedded devices must execute multimedia applications (e.g., 3D games, video players and signal processing software, etc.) that demand extensive memory acces...
José L. Risco-Martín, David Atienza,...
PPSN
1990
Springer
15 years 1 months ago
Feature Construction for Back-Propagation
T h e ease of learning concepts f r o m examples in empirical machine learning depends on the attributes used for describing the training d a t a . We show t h a t decision-tree b...
Selwyn Piramuthu
106
Voted
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
15 years 3 months ago
Interactive evolutionary multi-objective optimization and decision-making using reference direction method
In this paper, we borrow the concept of reference direction approach from the multi-criterion decision-making literature and combine it with an EMO procedure to develop an algorit...
Kalyanmoy Deb, Abhishek Kumar
AAAI
1996
14 years 10 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole