منابع مشابه
Noyes BIT - STRING SCATTERING THEORY
We construct discrete space-time coordinates separated by the Lorentz-invariant intervals h/me in space and h/mc2 in time using discrimination (XOR) between pa?rs of independently generated bit-strings; we prove that if this space is homogeneous and isotropic, it can have only 1, 2 or 3 spatial dimensions once we have related time to a global ordering operator. On this space we construct exact ...
متن کاملProof Labeling Schemes ∗ Amos Korman
This paper addresses the problem of locally verifying global properties. Several natural questions are studied, such as “how expensive is local verification?” and more specifically “how expensive is local verification compared to computation?” A suitable model is introduced in which these questions are studied in terms of the number of bits a node needs to communicate. In addition, approaches a...
متن کاملCompetitive Paging Algorithms AMOS FIAT
The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults. We develop the marking algorithm, a randomized on-line algorithm for the paging problem. We prove that its expected cost on any sequence of requests is within a factor of 2Hk of optimum. (Where Hk is the kth harmonic number, which is roughly Ink.) The best such facto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Iowa
سال: 1911
ISSN: 0003-4827,2473-9006
DOI: 10.17077/0003-4827.3700