Sciweavers

98 search results - page 12 / 20
» Cut-and-solve: An iterative search strategy for combinatoria...
Sort
View
TEC
2002
133views more  TEC 2002»
13 years 7 months ago
Learning and optimization using the clonal selection principle
The clonal selection principle is used to explain the basic features of an adaptive immune response to an antigenic stimulus. It establishes the idea that only those cells that rec...
Leandro Nunes de Castro, Fernando J. Von Zuben
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
13 years 8 months ago
A hybrid method for tuning neural network for time series forecasting
This paper presents an study about a new Hybrid method GRASPES - for time series prediction, inspired in F. Takens theorem and based on a multi-start metaheuristic for combinatori...
Aranildo Rodrigues Lima Junior, Tiago Alessandro E...
CP
2004
Springer
13 years 11 months ago
ID Walk: A Candidate List Strategy with a Simple Diversification Device
This paper presents a new optimization metaheuristic called ID Walk (Intensification/Diversification Walk) that offers advantages for combining simplicity with effectiveness. In ad...
Bertrand Neveu, Gilles Trombettoni, Fred Glover
JAIR
2007
141views more  JAIR 2007»
13 years 7 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
ILP
2004
Springer
14 years 26 days ago
A Monte Carlo Study of Randomised Restarted Search in ILP
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Filip Zelezný, Ashwin Srinivasan, David Pag...