Add to ORKGThesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.Includes bibliographical references (p. 27-29).by Ching Law.M.Eng
In evaluating an algorithm, worst-case analysis can be overly pessimistic. Average-case analysis can...
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
This is the published version. Copyright © 2000 Society for Industrial and Applied MathematicsWe pro...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
AbstractWe address the tradeoff between the competitive ratio and the resources used by randomized o...
AbstractWe address the tradeoff between the competitive ratio and the resources used by randomized o...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
We consider online algorithms for the generalized caching problem. Here we are given a cache of size...
AMS subject classi cations. 68N25, 68P01, 68P15, 68Q25, 68W20 PII. S0097539797324278We propose a pro...
We consider online algorithms for the generalized caching problem. Here we are given a cache of size...
We consider online algorithms for the generalized caching problem. Here we are given a cache of size...
We consider online algorithms for the generalized caching problem. Here we are given a cache of size...
Reconsider the competitiveness ofon-line strategies using k servers versus the optimal off-line stra...
AbstractThe paging problem is defined as follows: we are given a two-level memory system, in which o...
In evaluating an algorithm, worst-case analysis can be overly pessimistic. Average-case analysis can...
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
This is the published version. Copyright © 2000 Society for Industrial and Applied MathematicsWe pro...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
AbstractWe address the tradeoff between the competitive ratio and the resources used by randomized o...
AbstractWe address the tradeoff between the competitive ratio and the resources used by randomized o...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
We consider online algorithms for the generalized caching problem. Here we are given a cache of size...
AMS subject classi cations. 68N25, 68P01, 68P15, 68Q25, 68W20 PII. S0097539797324278We propose a pro...
We consider online algorithms for the generalized caching problem. Here we are given a cache of size...
We consider online algorithms for the generalized caching problem. Here we are given a cache of size...
We consider online algorithms for the generalized caching problem. Here we are given a cache of size...
Reconsider the competitiveness ofon-line strategies using k servers versus the optimal off-line stra...
AbstractThe paging problem is defined as follows: we are given a two-level memory system, in which o...
In evaluating an algorithm, worst-case analysis can be overly pessimistic. Average-case analysis can...
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
This is the published version. Copyright © 2000 Society for Industrial and Applied MathematicsWe pro...