Sciweavers

2180 search results - page 135 / 436
» Comparing bio-inspired algorithms in constrained optimizatio...
Sort
View
HEURISTICS
2006
120views more  HEURISTICS 2006»
15 years 3 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
15 years 7 months ago
BBOB-benchmarking two variants of the line-search algorithm
The restarted line search, or coordinate-wise search, algorithm is tested on the BBOB 2009 testbed. Two different univariate search algorithms (fminbnd from MATLAB and STEP) were...
Petr Posik
ISPD
2003
ACM
121views Hardware» more  ISPD 2003»
15 years 8 months ago
Optimality, scalability and stability study of partitioning and placement algorithms
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
Jason Cong, Michail Romesis, Min Xie
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
15 years 7 months ago
Using memetic algorithms to improve portfolio performance in static and dynamic trading scenarios
The Portfolio Optimization problem consists of the selection of a group of assets to a long-term fund in order to minimize the risk and maximize the return of the investment. This...
Claus de Castro Aranha, Hitoshi Iba
ROBOTICA
2002
72views more  ROBOTICA 2002»
15 years 2 months ago
Point-to-Point trajectory planning of flexible redundant robot manipulators using genetic algorithms
: The paper focuses on the problem of point-to-point trajectory planning for flexible redundant robot manipulators (FRM) in joint space. Compared with irredundant flexible manipula...
Shigang Yue, Dominik Henrich, W. L. Xu, S. K. Tso