Sciweavers

349 search results - page 29 / 70
» Optimal Strategies for Reviewing Search Results
Sort
View
COR
2006
98views more  COR 2006»
14 years 12 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
15 years 27 days 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...
ICALP
2003
Springer
15 years 5 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 5 months ago
MeSwarm: memetic particle swarm optimization
In this paper, a novel variant of particle swarm optimization (PSO), named memetic particle swarm optimization algorithm (MeSwarm), is proposed for tackling the overshooting probl...
Bo-Fu Liu, Hung-Ming Chen, Jian-Hung Chen, Shiow-F...
IMCSIT
2010
14 years 9 months ago
ACO with semi-random start applied on MKP
Ant Colony Optimization (ACO) is a stochastic search method that mimics the social behavior of real ants colonies, which manage to establish the shortest route to feeding sources a...
Stefka Fidanova, Pencho Marinov, Krassimir T. Atan...