Problem solution sustenance in XCS: Markov chain analysis of niche support distributions and the impact on computational complexity

Author： Butz Martin Goldberg David Lanzi Pier Sastry Kumara

Publisher： Springer Publishing Company

ISSN： 1389-2576

Source： Genetic Programming and Evolvable Machines, Vol.8, Iss.1, 2007-03, pp. : 5-37

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the Computational Complexity of Approximating Distributions by Probabilistic Automata

By Abe N.

Machine Learning, Vol. 9, Iss. 2-3, 1992-07 ,pp. : 205-260

Springer Publishing Company

Access to resources Recommend Favorite

Large deviations for distributions of sums of random variables: Markov chain method

By Fatalov V.

Problems of Information Transmission, Vol. 46, Iss. 2, 2010-06 ,pp. : 160-183

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

On the complexity of the k-chain subgraph cover problem

By Yu C.-W. Chen G.-H. Ma T.-H.

Theoretical Computer Science, Vol. 205, Iss. 1, 1998-08 ,pp. : 85-98

Elsevier

Access to resources Recommend Favorite

The consensus string problem and the complexity of comparing hidden Markov models

By Lyngsø R.B. Pedersen C.N.S.

Journal of Computer and System Sciences, Vol. 65, Iss. 3, 2002-11 ,pp. : 545-569

Academic Press

Access to resources Recommend Favorite

Stochastic lot-sizing with backlogging: computational complexity analysis

By Guan Yongpei

Journal of Global Optimization, Vol. 49, Iss. 4, 2011-04 ,pp. : 651-678

Springer Publishing Company

Access to resources Recommend Favorite