نتایج جستجو برای: minimum time
تعداد نتایج: 2012871 فیلتر نتایج به سال:
Journal:
:Physical Review E
2002
Journal:
:IEE Proceedings - Control Theory and Applications
2002
Journal:
:Information & Computation
2021
We give two fully dynamic algorithms that maintain a (1+ε)-approximation of the weight M minimum spanning forest (MSF) an n-node graph G with edges weights in [1,W], for any ε>0. (1) Our deterministic algorithm takes O(W2logW/ε3) worst-case update time, which is O(1) if both W and ε are constants. (2) randomized (Monte-Carlo style) works high probability runs O(logW/ε4) time W=O((m⁎)1/6/log2/...
Journal:
:The Journal of Japan Institute of Navigation
1997
Journal:
:SIAM Journal on Control and Optimization
2012
Journal:
:IET Information Security
2020
Journal:
:Acta Mechanica et Automatica
2015
Journal:
:The Journal of Japan Institute of Navigation
2002
Journal:
:SIAM Journal on Computing
2005
Journal:
:Mathematical Programming
2020
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید