Curve matching is an important computational task for domains such as: reconstruction of archaeological fragments, forensics investigation, measuring melodic similarity, and model...
Most probabilistic inference algorithms are specified and processed on a propositional level. In the last decade, many proposals for algorithms accepting first-order specificat...
Optimal solutions to Markov Decision Problems (MDPs) are very sensitive with respect to the state transition probabilities. In many practical problems, the estimation of those pro...
X-ray mapping images of polished sections are classified using two unsupervised clustering algorithms. The methods applied are the k-means algorithm and an extended spectral fuzzy...
Klaus Baggesen Hilger, Allan Aasbjerg Nielsen, Jen...
An important goal of the theory of genetic algorithms is to build predictive models of how well genetic algorithms are expected to perform, given a representation, a fitness lands...