搜索结果: 1-1 共查到“计算机科学技术基础学科 Randomized Fixed-Point Computation”相关记录1条 . 查询时间(0.078 秒)
Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation
Local Search:Tight Bound Randomized Fixed-Point Computation
2012/12/3
In 1983, Aldous proved that randomization can speedup local search. For example, it reduces the query complexity of local search over grid [1 : n]d from Θ(nd−1) to O(d1/2nd/2). It remains open w...