Sciweavers

250 search results - page 12 / 50
» General variable neighborhood search for the continuous opti...
Sort
View
MSV
2004
15 years 1 months ago
S(b)-Trees: An Optimal Balancing of Variable Length Keys
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
Konstantin V. Shvachko
GECCO
2008
Springer
104views Optimization» more  GECCO 2008»
15 years 24 days ago
Understanding elementary landscapes
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...
Darrell Whitley, Andrew M. Sutton, Adele E. Howe
INFORMS
2007
150views more  INFORMS 2007»
14 years 11 months ago
SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization
— We describe the development and testing of a metaheuristic procedure, based on the scatter search methodology, for the problem of approximating the efficient frontier of nonlin...
Julián Molina Luque, Manuel Laguna, Rafael ...
PATAT
2004
Springer
141views Education» more  PATAT 2004»
15 years 5 months ago
A Hybrid Multi-objective Evolutionary Algorithm for the Uncapacitated Exam Proximity Problem
A hybrid Multi-Objective Evolutionary Algorithm is used to tackle the uncapacitated exam proximity problem. In this hybridization, local search operators are used instead of the tr...
Pascal Côté, Tony Wong, Robert Sabour...
CDC
2008
IEEE
15 years 6 months ago
The vanishing approach for the average continuous control of piecewise deterministic Markov processes
Abstract— This paper deals with the long run average continuous control problem of piecewise deterministic Markov processes (PDMP‘s) taking values in a general Borel space and ...
Oswaldo Luiz V. Costa, Francois Dufour