نتایج جستجو برای: time dependent availability
تعداد نتایج: 2547064 فیلتر نتایج به سال:
Journal:
:ACM Transactions on Algorithms
2022
We study the biased random walk where at each step of a "controller" can, with certain small probability, move to an arbitrary neighbour. This model was introduced by Azar et al. [STOC'1992]; we extend their work time dependent setting and consider cover times this walk. obtain new bounds on hitting times. conjectured that controller can increase stationary probability vertex from $p$ $p^{1-\ep...
Journal:
:Monthly Notices of the Royal Astronomical Society
2018
Journal:
:Journal of Physics A: Mathematical and General
1986
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید