Sciweavers

159 search results - page 6 / 32
» Solving NP-Complete Problems With Networks of Evolutionary P...
Sort
View
GPEM
2002
163views more  GPEM 2002»
13 years 7 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf
STOC
1991
ACM
167views Algorithms» more  STOC 1991»
13 years 11 months ago
Counting Networks and Multi-Processor Coordination
d Abstract) James Aspnes Maurice Herlihyy Nir Shavitz Digital Equipment Corporation Cambridge Research Lab CRL 90/11 September 18, 1991 Many fundamental multi-processor coordinati...
James Aspnes, Maurice Herlihy, Nir Shavit
ESCIENCE
2006
IEEE
13 years 11 months ago
A Differential Evolution Based Algorithm to Optimize the Radio Network Design Problem
In this paper we present a Differential Evolution based algorithm used to solve the Radio Network Design (RND) problem. This problem consists in determining the optimal locations ...
Silvio Priem-Mendes, Juan Antonio Gómez Pul...
EVOW
2007
Springer
14 years 1 months ago
Genetic Representations for Evolutionary Minimization of Network Coding Resources
Abstract. We demonstrate how a genetic algorithm solves the problem of minimizing the resources used for network coding, subject to a throughput constraint, in a multicast scenario...
Minkyu Kim, Varun Aggarwal, Una-May O'Reilly, Muri...
IWANN
2001
Springer
13 years 12 months ago
Evolving RBF Neural Networks
This paper is focused on determining the parameters of radial basis function neural networks (number of neurons, and their respective centers and radii) automatically. While this ...
Víctor Manuel Rivas Santos, Pedro A. Castil...