605 search results - page 109 / 121 » Comparison of Evolutionary Algorithms for Design Optimizatio... |
ICOIN
2003
Springer
14 years 26 days ago
2003
Springer
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
EVOW
2007
Springer
13 years 11 months ago
2007
Springer
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
GECCO
2003
Springer
14 years 26 days ago
2003
Springer
Abstract. The problem of designing symmetric key cryptography algorithms based upon cellular automata (CAs) is considered. The reliability of the Vernam cipher used in the process ...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Bloat is a common problem with Evolutionary Algorithms (EAs) that use variable length representation. By creating unnecessarily large individuals it results in longer EA runtimes ...