Randomized Shortest-Path Problems: Two Related Models (Q5323768): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
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.1162/neco.2009.11-07-643 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2122597713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Path Choice Entropy in General Transport Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3361866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4257216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fastest Mixing Markov Chain on a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3903001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Methods for Sparse Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biological Sequence Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The entropy of Markov trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Time Approach to Non-Relativistic Quantum Mechanics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313998 / 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: Entropy Rate and Maximum Entropy Methods for Countable Semi-Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3467420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Theory and Statistical Mechanics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs, networks and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4094202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristic functions of directed graphs and applications to stochastic equilibrium problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4839003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4392284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3103800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4224235 / rank
 
Normal rank

Revision as of 21:00, 1 July 2024

scientific article; zbMATH DE number 5588650
Language Label Description Also known as
English
Randomized Shortest-Path Problems: Two Related Models
scientific article; zbMATH DE number 5588650

    Statements

    Randomized Shortest-Path Problems: Two Related Models (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 July 2009
    0 references
    0 references
    finite Markov chain
    0 references
    expected Shannon entropy spread
    0 references
    necessary conditions
    0 references
    optimal policy
    0 references
    0 references