Sciweavers

13 search results - page 3 / 3
» Iterated k-Opt Local Search for the Maximum Clique Problem
Sort
View
AAAI
2000
13 years 6 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
LION
2007
Springer
192views Optimization» more  LION 2007»
13 years 11 months ago
Learning While Optimizing an Unknown Fitness Surface
This paper is about Reinforcement Learning (RL) applied to online parameter tuning in Stochastic Local Search (SLS) methods. In particular a novel application of RL is considered i...
Roberto Battiti, Mauro Brunato, Paolo Campigotto
AUTOMATICA
2005
112views more  AUTOMATICA 2005»
13 years 5 months ago
Robust maximum-likelihood estimation of multivariable dynamic systems
This paper examines the problem of estimating linear time-invariant state-space system models. In particular it addresses the parametrization and numerical robustness concerns tha...
Stuart Gibson, Brett Ninness