840 search results - page 7 / 168 » Inapproximability of Combinatorial Optimization Problems |
CEC
2008
IEEE
14 years 4 months ago
2008
IEEE
: Differential evolutionary (DE) mutates solution vectors by the weighted difference of other vectors using arithmetic operations. As these operations cannot be directly extended t...
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
SWARM
2012
SPRINGER
12 years 5 months ago
2012
SPRINGER
Applying parameter adaptation means operating on parameters of an algorithm while it is tackling an instance. For ant colony optimization, several parameter adaptation methods have...
EVOW
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Evolutionary algorithms are powerful tools in search and optimization tasks with several applications in complex engineering problems. However, setting all associated par...
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
Quantum-inspired evolutionary algorithms (QIEAs), as a subset of evolutionary computation, are based on the principles of quantum computing such as quantum bits and quantum superp...