1013 search results - page 16 / 203 » A Subexponential Algorithm for Abstract Optimization Problem... |
EMO
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Multi-objective evolutionary algorithms (MOEAs) have proven to be a powerful tool for global optimization purposes of deterministic problem functions. Yet, in many real-w...
73
Voted
EMO
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. In this paper, we propose an approach for solving hierarchical multi-objective optimization problems (MOPs). In realistic MOPs, two main challenges have to be considered:...
80
Voted
TJS
2002
14 years 9 months ago
2002
Abstract. This paper focuses on BSR (Broadcasting with Selective Reduction) implementation of algorithms solving basic convex polygon problems. More precisely, constant time soluti...
ASIAN
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
103
click to vote
CEC
2011
IEEE
13 years 9 months ago
2011
IEEE
Abstract—In this paper, we propose a framework for employing opposition-based learning to assist evolutionary algorithms in solving discrete and combinatorial optimization proble...