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...
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...
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...
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...
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...