Sciweavers

14779 search results - page 348 / 2956
» On Ultrametric Algorithmic Information
Sort
View
146
Voted
GECCO
2005
Springer
130views Optimization» more  GECCO 2005»
16 years 8 days ago
Hybrid real-coded mutation for genetic algorithms applied to graph layouts
In this paper we introduce an application of real-coded genetic algorithms to the problem of consistent graph layout and exploring the role of mutation for this particular problem...
Dana Vrajitoru, Jason DeBoni
ANTSW
2004
Springer
16 years 5 days ago
A Comparison Between ACO Algorithms for the Set Covering Problem
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
Lucas Lessing, Irina Dumitrescu, Thomas Stütz...
ISCIS
2003
Springer
15 years 12 months ago
Gene Level Concurrency in Genetic Algorithms
This study describes an alternative concurrency approach in genetic algorithms. Inspiring from implicit parallelism in a physical chromosome, a vertical concurrency is introduced. ...
Onur Tolga Sehitoglu, Göktürk Ü&cce...
193
Voted
ISIPTA
1999
IEEE
103views Mathematics» more  ISIPTA 1999»
15 years 11 months ago
A Review of Propagation Algorithms for Imprecise Probabilities
This paper reviews algorithms for local computation with imprecise probabilities. These algorithms try to solve problems of inference calculation of conditional or unconditional p...
Andrés Cano, Serafín Moral
166
Voted
ICGA
1997
103views Optimization» more  ICGA 1997»
15 years 8 months ago
Genetic Algorithm for Restrictive Channel Routing Problem
This paper presents a genetic algorithm for the restrictive channel routing problem. The major difference of the algorithm from already known genetic algorithms for this problem c...
Vladimir N. Davidenko, Victor M. Kureichik, Victor...