نتایج جستجو برای: online
تعداد نتایج: 255882 فیلتر نتایج به سال:
Journal:
:Inf. Process. Lett.
1994
Jon M. Kleinberg
We consider the class of balancing algorithms for two servers. Such algorithms have appeared in a number of the early papers on this problem; they are so named because they seek to \balance" the distance traveled evenly among the servers. In this paper, we show a universal lower bound on the competitive ratio of any balancing algorithm for two servers. The lower bound is equal to (5 + p 7)=2 (3...
Journal:
:Journal of College Orientation, Transition, and Retention
2019
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید