← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

27 第27章 在线算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.747Z

arrive at the ground floor, we can express the time that the seer spends as the function

We typically evaluate online algorithms by their competitive ratio. Let U denote the set (universe) of all possible inputs, and consider some input I ∈ U. For a minimization problem, such as the stairs-versus-elevator problem, if an online

algorithm A produces a solution with value A(I) on input I and the solution from an algor

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter027.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea