Estimation of State Probabilities Using the Maximum Entropy Principle

DOI10.1147/RD.245.0563MaRDI QIDQ3880065zbMATH OpenOpenAlexFDO

Authors Yonathan Bard

Publication date 1980

Published in IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1147/rd.245.0563

zbMATH Keywords

computer performance analysiscomputing state probabilitiesmaximum entropy principle

Mathematics Subject Classification ID

Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov processes: estimation; hidden Markov models (62M05) Non-Markovian processes: estimation (62M09) Measures of information, entropy (94A17)

Cited in

(5)

• The presence of exponentiality in entropy maximized M/GI/1 queues
• A maximum entropy analysis of the M/G/1 and G/M/1 queueing systems at equilibrium
• Entropy maximisation and queueing network models
• Multi-robot inverse reinforcement learning under occlusion with estimation of state transitions
• Maximum entropy analysis to the N policy M/G/1 queueing system with a removable server

This page was built for publication: Estimation of State Probabilities Using the Maximum Entropy Principle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3880065)