We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...
William J. Knottenbelt, Mark Mestern, Peter G. Har...
Classifying the endgame positions in Chess can be challenging for humans and is known to be a difficult task in machine learning. An evolutionary algorithm would seem to be the ide...
The problem of determining the evolutionary history of species in the form of phylogenetic trees is known as the phylogeny problem. We present a parallelization of the character c...
Traditionally, analysis of flow fields resulting from computational fluid dynamics (CFD) calculations is a sequential process. The flow area defined by surrounding geometry is tes...
Abstract. The previously proposed cunning ant system (cAS), a variant of the ACO algorithm, worked well on the TSP and the results showed that the cAS could be one of the most prom...