搜索结果: 1-2 共查到“计算机科学技术基础学科 beyond”相关记录2条 . 查询时间(0.015 秒)
We describe a symbolic heap abstraction that unifies reasoning about arrays, pointers, and scalars, and we define a fluid update operation on this symbolic heap that relaxes the dichotomy between stro...
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...