arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1509.05071cond-mat.stat-mechphysics.bio-ph
收藏

Michaelis-Menten反应方案作为解决最优再启动问题的统一方法

The Michaelis-Menten reaction scheme as a unified approach towards the optimal restart problem

Tal Rotbart, Shlomi Reuveni, Michael Urbakh

摘要:

我们研究的影响,重新启动,并重试,一个通用的进程的平均完成时间。这样做的需要出现在科学的各个分支,我们表明,它可以自然地解决利用米氏和Menten的经典反应计划。停止一个过程,只是为了重新开始,可能会延长,保持不变,甚至缩短完成所需的时间。在这里,我们感兴趣的是最佳重新启动问题,即,在寻找一个重新启动率,使一个过程的平均完成时间最小。我们推导出这个问题的控制方程,并表明它是完全可解的情况下,特别感兴趣的。然后,我们继续发现制度,在该问题的解决方案采取普遍的,独立的细节,形式,进一步产生最佳的比例律。我们开发的形式主义,并获得的结果,可以利用时,优化随机搜索过程和随机计算机算法。还指出并讨论了与动态校对的直接联系。

英文摘要:

We study the effect of restart, and retry, on the mean completion time of a generic process. The need to do so arises in various branches of the sciences and we show that it can naturally be addressed by taking advantage of the classical reaction scheme of Michaelis and Menten. Stopping a process in its midst, only to start it all over again, may prolong, leave unchanged, or even shorten the time taken for its completion. Here we are interested in the optimal restart problem, i.e., in finding a restart rate which brings the mean completion time of a process to a minimum. We derive the governing equation for this problem and show that it is exactly solvable in cases of particular interest. We then continue to discover regimes at which solutions to the problem take on universal, details independent, forms which further give rise to optimal scaling laws. The formalism we develop, and the results obtained, can be utilized when optimizing stochastic search processes and randomized computer algorithms. An immediate connection with kinetic proofreading is also noted and discussed.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑