159 search results - page 5 / 32 » Solving NP-Complete Problems With Networks of Evolutionary P... |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
GECCO
2003
Springer
14 years 23 days ago
2003
Springer
In this paper, we revisit a general class of multi-criteria multi-constrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A ma...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Efficient and effective deployment of IEEE 802.16 networks to service an area of users with certain traffic demands is an important network planning problem. We resort to an evol...
SPDP
1991
IEEE
13 years 11 months ago
1991
IEEE
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
EUROGP
2010
Springer
14 years 2 months ago
2010
Springer
We discuss how to use a Genetic Regulatory Network as an evolutionary representation to solve a typical GP reinforcement problem, the pole balancing. The network is a modified ver...