The Relative Worst Order Ratio for On-Line Algorithms

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-44849-7_13
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

On the Worst-Case Behavior of String-Searching Algorithms

SIAM Journal on Computing
MathematicsComputer Science
1977English

On the Worst Case Complexity of Potential Reduction Algorithms for Linear Programming

Mathematical Programming, Series B
MathematicsSoftware
1997English

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

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

Improved Algorithms for Edit Distance and LCS: Beyond Worst Case

2020English

Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

SIAM Journal on Computing
MathematicsComputer Science
1974English

Streaming Algorithms for Line Simplification

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2009English

Smooth On-Line Learning Algorithms for Hidden Markov Models

Neural Computation
ArtsCognitive NeuroscienceHumanities
1994English

Improved On-Line Scheduling Algorithms for Optical WDM Networks

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
1998English

Aimed for the Better, Ended Up With the Worst: Russia and International Order

Journal on Baltic Security
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy