Sciweavers

3165 search results - page 376 / 633
» Introduction to genetic algorithms
Sort
View
EVOW
2001
Springer
15 years 11 months ago
An Evolutionary Annealing Approach to Graph Coloring
This paper presents a new heuristic algorithm for the graph coloring problem based on a combination of genetic algorithms and simulated annealing. Our algorithm exploits a novel cr...
Dimitris Fotakis, Spiridon D. Likothanassis, Stama...
DIS
2006
Springer
15 years 10 months ago
A Novel Framework for Discovering Robust Cluster Results
We propose a novel method, called heterogeneous clustering ensemble (HCE), to generate robust clustering results that combine multiple partitions (clusters) derived from various cl...
Hye-Sung Yoon, Sang-Ho Lee, Sung-Bum Cho, Ju Han K...
WIA
2000
Springer
15 years 10 months ago
Fast Implementations of Automata Computations
Abstract. In 6], G. Myers describes a bit-vector algorithm to compute the edit distance between strings. The algorithm converts an input sequence to an output sequence in a paralle...
Anne Bergeron, Sylvie Hamel
GECCO
2008
Springer
112views Optimization» more  GECCO 2008»
15 years 7 months ago
Parameter-less evolutionary search
The paper presents the parameter-less implementation of an evolutionary-based search. It does not need any predefined control parameters values, which are usually used for geneti...
Gregor Papa
SAC
2012
ACM
14 years 2 months ago
Decrypting classical cipher text using Markov chain Monte Carlo
In this paper, we present the use of Markov Chain Monte Carlo (MCMC) methods to attack the classical ciphers. We use frequency analysis as our basic tool. First we investigate the...
Jian Chen, Jeffrey S. Rosenthal