Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions

标题
Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
作者
关键词
-
出版物
COMBINATORICS PROBABILITY & COMPUTING
Volume 22, Issue 02, Pages 294-318
出版商
Cambridge University Press (CUP)
发表日期
2013-01-09
DOI
10.1017/s0963548312000600

向作者/读者发起求助以获取更多资源

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started