Sciweavers

721 search results - page 8 / 145
» Genetic State-Space Search for Constrained Optimization Prob...
Sort
View
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
14 years 26 days ago
Ant Colony Programming for Approximation Problems
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wiec...
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
13 years 11 months ago
A fast hybrid genetic algorithm for the quadratic assignment problem
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
Alfonsas Misevicius
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
13 years 11 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
HIPEAC
2010
Springer
14 years 4 months ago
Performance and Power Aware CMP Thread Allocation Modeling
We address the problem of performance and power-efficient thread allocation in a CMP. To that end, based on analytical model, we introduce a parameterized performance/power metric ...
Yaniv Ben-Itzhak, Israel Cidon, Avinoam Kolodny
GECCO
2000
Springer
225views Optimization» more  GECCO 2000»
13 years 11 months ago
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa