Revision as of 00:28, 5 March 2007 edit Utopianheaven (talk \| contribs) 373 edits m +link to orignal paper ← Previous edit		Revision as of 00:35, 5 March 2007 edit undo Utopianheaven (talk \| contribs) 373 edits →Algorithm: R_i >= sqrt(N - 1)... an optimal quorm set is sqrt(N-1), p.3 of Maekawa's paper states it as such "[...] With a fractional error, we see that K=sqrt(N)"... also Section 7, Method 1 Next edit →
Line 39: :Therefore: :* <math>\|R_i\| ~~= 2~~\geq \sqrt{N - 1}</math> === Performance ===

Maekawa's algorithm: Difference between revisions