scientific article; zbMATH DE number 888812
From MaRDI portal
Publication:4881890
zbMATH Open0852.60081MaRDI QIDQ4881890FDOQ4881890
Authors: Costel Bălcău
Publication date: 2 December 1996
Title of this publication is not available (Why is that?)
Recommendations
Linear programming (90C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Measures of information, entropy (94A17)
Cited In (14)
- Title not available (Why is that?)
- Ranking nodes according to their path-complexity
- Entropy: the Markov ordering approach
- Title not available (Why is that?)
- Linearly constrained Iosifescu-Theodorescu entropy maximization for homogeneous stationary multiple Markov chains
- Homogeneous stationary multiple Markov chains with maximum Iosifescu-Theodorescu entropy
- On Maxentropic Reconstruction of Countable Markov Chains and Matrix Scaling Problems
- Maxentropy completion and properties of some partially defined stationary Markov chains
- Entropy maximization for Markov and semi-Markov processes
- Entropy Maximization for Partially Observable Markov Decision Processes
- Maximum entropy for determining the transition probability matrix of a Markov chain with a specified stationary distribution
- Some informational properties of Markov pure-jump processes
- Maximum Kolmogorov-Sinai entropy versus minimum mixing time in Markov chains
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4881890)