1310 search results - page 179 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
WCE
2007
13 years 10 months ago
2007
Abstract—Applications of the Particle Swarm Optimization (PSO) to solve image processing problem with a reference to a new automatic enhancement technique based on real-coded par...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
IPPS
1994
IEEE
14 years 28 days ago
1994
IEEE
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
GECCO
2011
Springer
13 years 9 days ago
2011
Springer
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
CGO
2011
IEEE
13 years 18 days ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...