Sciweavers

2244 search results - page 45 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
ICIP
2007
IEEE
16 years 7 months ago
Dart: A Fast Heuristic Algebraic Reconstruction Algorithm for Discrete Tomography
Discrete tomography (DT) is concerned with the tomographic reconstruction of images that consist of only a small number of gray levels. DT reconstruction problems are usually unde...
Kees Joost Batenburg, Jan Sijbers
GECCO
2005
Springer
196views Optimization» more  GECCO 2005»
15 years 11 months ago
Breeding swarms: a new approach to recurrent neural network training
This paper shows that a novel hybrid algorithm, Breeding Swarms, performs equal to, or better than, Genetic Algorithms and Particle Swarm Optimizers when training recurrent neural...
Matthew Settles, Paul Nathan, Terence Soule
GPEM
2002
163views more  GPEM 2002»
15 years 5 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
CORR
2007
Springer
131views Education» more  CORR 2007»
15 years 6 months ago
How to use the Scuba Diving metaphor to solve problem with neutrality ?
Abstract. We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality which exists in ...
Philippe Collard, Sébastien Vérel, M...
GD
2001
Springer
15 years 10 months ago
Labeling Heuristics for Orthogonal Drawings
This paper studies the problem of computing an orthogonal drawing of a graph with labels along the edges. Labels are not allowed to overlap with each other or with edges to which t...
Carla Binucci, Walter Didimo, Giuseppe Liotta, Mad...