نتایج جستجو برای: 0038 respectively similarly

تعداد نتایج: 771397  

1994
Baruch Awerbuch Rafail Ostrovsky

In this paper we consider the question of fault-tolerant distributed network protocols with extremely small memory requirements per processor. In particular, we show that even in the case of worst-case transient faults (i.e., in a self-stabilizing setting), many fundamental network protocols can be achieved using only O(log n) bits of memory per incident network edge. In the heart of our constr...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید