Computational intelligence: From mathematical point of view
DOI10.1007/BF02885056zbMATH Open1021.68511OpenAlexW2011684682MaRDI QIDQ701623FDOQ701623
Authors: Minping Qian, Gong Guanglu 
Publication date: 6 November 2002
Published in: Chinese Science Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02885056
Recommendations
simulated annealinghidden Markov modelsneural networksevolutionary programmingadapting algorithmsself-organizing learning
Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cites Work
- Optimization by simulated annealing
- Hidden Markov random fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Neural networks and physical systems with emergent collective computational abilities
- Simulated annealing via Sobolev inequalities
- Title not available (Why is that?)
- Maximum-likelihood estimation for hidden Markov models
- Title not available (Why is that?)
- Self-organization and associative memory.
- Title not available (Why is that?)
- On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrix
- Annealing of Iterative Stochastic Schemes
- Modeling Brain Function
- Diffusion for Global Optimization in $\mathbb{R}^n $
- Genetic Algorithms and the Optimal Allocation of Trials
- A limit theorem for a class of inhomogeneous Markov processes
- Large-time behavior of perturbed diffusion Markov processes with applications to the second eigenvalue problem for Fokker-Planck operators and simulated annealing
- Self-organization and a.s. convergence of the one-dimensional Kohonen algorithm with non-uniformly distributed stimuli
- Disconvergence of Cauchy annealing
- A self-organizing cluster process
- An improved annealing method and its large-time behavior
- Subduction coefficients of Birman-Wenzl algebras and Racah coefficients of the quantum groups \(O_q(n)\) and \(Sp_q(2m)\). I: Subduction coefficients
- Title not available (Why is that?)
- On the Convergence Rate of Annealing Processes
- Title not available (Why is that?)
Cited In (5)
- Mathematical structures of natural intelligence
- On the Similarity Between Neural Network and Evolutionary Algorithm
- Convergence analysis of a class of computational intelligence approaches
- Interactions between computational intelligence and mathematics
- The research and advances on some focus questions in computation intelligence
This page was built for publication: Computational intelligence: From mathematical point of view
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701623)
