Sciweavers

15033 search results - page 47 / 3007
» Complexity Theory and Algorithms
Sort
View
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
15 years 8 months ago
Computational Complexity of Two-Dimensional Platform Games
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...
Michal Forisek
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
15 years 8 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
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 ...
Stefan Droste
CORR
2002
Springer
113views Education» more  CORR 2002»
15 years 3 months ago
Generic-case complexity, decision problems in group theory and random walks
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...
JCP
2007
150views more  JCP 2007»
15 years 3 months ago
Bayesian Networks and Evidence Theory to Model Complex Systems Reliability
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...
Christophe Simon, Philippe Weber, Eric Levrat