381 search results - page 23 / 77 » Time Complexity of genetic algorithms on exponentially scale... |
MONET
2008
13 years 7 months ago
2008
Genetic algorithms are best suited for optimization problems involving large search spaces. The problem space encountered when optimizing the transmission parameters of an agile or...
KES
1999
Springer
13 years 12 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
EMO
2003
Springer
14 years 28 days 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:...
SECURWARE
2008
IEEE
14 years 2 months ago
2008
IEEE
Firewalls provide the first line of defence of nearly all networked institutions today. However, Firewall ACLs could have inconsistencies, allowing traffic that should be denied o...
CEC
2009
IEEE
13 years 5 months ago
2009
IEEE
This paper examines a simulation of the Beer Distribution Game and a number of optimisation approaches to this game. This well known game was developed at MIT in the 1960s and has ...