Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, V...
Abstract— This paper deals with the use of Bayesian Networks to compute system reliability of complex systems under epistemic uncertainty. In the context of incompleteness of rel...