Using Markov Chains to Design Algorithms for Bounded-Space On-Line Bin Cover

doi 10.1137/1.9781611972863.8
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Smooth On-Line Learning Algorithms for Hidden Markov Models

Neural Computation
ArtsCognitive NeuroscienceHumanities
1994English

Design of On-Line Algorithms Using Hitting Times

SIAM Journal on Computing
MathematicsComputer Science
1999English

Row-Continuous Finite Markov Chains : Structure and Algorithms

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1987English

Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2009English

Space Mapping Optimization Algorithms for Engineering Design

2006English

Occupation Times for Markov and Semi-Markov Chains

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1962English

Ergodicity of Fuzzy Markov Chains Based on Simulation Using Sequences

Journal of Mathematics and Computer Science
Computational MechanicsComputational MathematicsComputer Science ApplicationsMathematics
2014English

On Forward Recursive Estimation for Bivariate Markov Chains

2012English

Segregating Markov Chains

Journal of Theoretical Probability
MathematicsStatisticsUncertaintyProbability
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy