Hierarchical clustering is used widely to organize data and search for patterns. Previous algorithms assume that the body of data being clustered is fixed while the algorithm runs...
H. Van Dyke Parunak, Richard Rohwer, Theodore C. B...
This is the first article analyzing the security of SHA-256 against fast collision search which considers the recent attacks by Wang et al. We show the limits of applying technique...
Florian Mendel, Norbert Pramstaller, Christian Rec...
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...