Maximizing entropy over Markov processes (Q465487): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q87 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6360845 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jlamp.2014.05.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998783985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assessing security threats of looping constructs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantifying Information Leakage of Randomized Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Theory and Statistical Mechanics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative Information Flow, Relations and Polymorphic Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Foundations of Quantitative Information Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract non-interference / rank
 
Normal rank
Property / cites work
 
Property / cites work: An abstract interpretation-based model for safety semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anonymity protocols as noisy channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2005 – Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-Checking ω-Regular Properties of Interval Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval-valued finite Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy maximization for Markov and semi-Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal logics for the specification of performance and reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Probabilistic Automata / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:35, 9 July 2024

scientific article
Language Label Description Also known as
English
Maximizing entropy over Markov processes
scientific article

    Statements

    Maximizing entropy over Markov processes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 October 2014
    0 references
    0 references
    0 references