On the Complexity to Approach Optimum Solutions by Inhomogeneous Markov Chains

Andreas Alexander Albrecht. On the Complexity to Approach Optimum Solutions by Inhomogeneous Markov Chains. In Kalyanmoy Deb, Riccardo Poli, Wolfgang Banzhaf, Hans-Georg Beyer, Edmund K. Burke, Paul J. Darwen, Dipankar Dasgupta, Dario Floreano, James A. Foster, Mark Harman, Owen Holland, Pier Luca Lanzi, Lee Spector, Andrea Tettamanzi, Dirk Thierens, Andrew M. Tyrrell, editors, Genetic and Evolutionary Computation - GECCO 2004, Genetic and Evolutionary Computation Conference, Seattle, WA, USA, June 26-30, 2004, Proceedings, Part I. Volume 3102 of Lecture Notes in Computer Science, pages 642-653, Springer, 2004. [doi]

Authors

Andreas Alexander Albrecht

This author has not been identified. Look up 'Andreas Alexander Albrecht' in Google