期刊
INFORMATION PROCESSING LETTERS
卷 114, 期 1-2, 页码 38-41出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ipl.2013.09.013
关键词
Randomized algorithms; Randomized search heuristics; Running time analysis; Fitness-level method; Tail bounds
The fitness-level method, also called the method of f-based partitions, is an intuitive and widely used technique for the running time analysis of randomized search heuristics. It was originally defined to prove upper and lower bounds on the expected running time. Recently, upper tail bounds were added to the technique; however, these tail bounds only apply to running times that are at least twice as large as the expectation. We remove this restriction and supplement the fitness-level method with sharp tail bounds, including lower tails. As an exemplary application, we prove that the running time of randomized local search on ONEMAX is sharply concentrated around n In n - 0.1159...n. (C) 2013 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据