Amanote Research

Amanote Research

    RegisterSign In

Efficient Worst Case Timing Analysis of Data Caching

doi 10.1109/rttas.1996.509540
Full Text
Open PDF
Abstract

Available in full text

Date

Unknown

Authors

Unknown

Publisher

IEEE Comput. Soc. Press


Related search

Probabilistic Worst-Case Timing Analysis

ACM Computing Surveys
Computer ScienceTheoretical Computer Science
2019English

A Probabilistic Analysis of Data Popularity in ATLAS Data Caching

Journal of Physics: Conference Series
AstronomyPhysics
2012English

Worst-Case Mechanism Design via Bayesian Analysis

SIAM Journal on Computing
MathematicsComputer Science
2017English

New Efficient Caching Strategy Based on Clustering in Named Data Networking

International Journal of Interactive Mobile Technologies
Computer NetworksE-learningComputer Science ApplicationsCommunications
2019English

Obstacles in Worst-Case Execution Time Analysis

2008English

Beyond Worst-Case Analysis for Joins With Minesweeper

2014English

Worst -Case L1 Identification Based on Correlation Analysis

Transactions of the Institute of Systems, Control and Information Engineers
2000English

Abstract Interpretation for Worst and Average Case Analysis

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

Learning Automata Based Caching for Efficient Data Access in Delay Tolerant Networks

Wireless Communications and Mobile Computing
Computer NetworksElectronic EngineeringInformation SystemsElectricalCommunications
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy