Design of On-Line Algorithms Using Hitting Times

SIAM Journal on Computing - United States
doi 10.1137/s0097539798335511
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Random Walks on Dynamical Percolation: Mixing Times, Mean Squared Displacement and Hitting Times

Probability Theory and Related Fields
UncertaintyStatisticsProbabilityAnalysis
2014English

Hitting Times for Random Walks on Vertex-Transitive Graphs

Mathematical Proceedings of the Cambridge Philosophical Society
Mathematics
1989English

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

2006English

Design and Comparison of Genetic Algorithms for Mixed-Model Assembly Line Balancing Problem With Original Task Times of Models

American Journal of Industrial and Business Management
2016English

A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2010English

Stochastic Calculus for Gaussian Processes and Application to Hitting Times

Communications on Stochastic Analysis
StatisticsProbability
2012English

Off-Line and On-Line Algorithms for Closed String Factorization

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

Generalized Continuous-Time Random Walks, Subordination by Hitting Times, and Fractional Dynamics

Theory of Probability and its Applications
UncertaintyStatisticsProbability
2009English

Hitting Times, Occupation Times, Trivariate Laws and the Forward Kolmogorov Equation for a One-Dimensional Diffusion With Memory

Advances in Applied Probability
Applied MathematicsStatisticsProbability
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy