Online Algorithms with Advice for the -search Problem

In the online search problem, a seller seeks to find the maximum price from a sequence of prices p1, p2,…, pn that is revealed in a piece-wise manner. The bound for all prices is well known in advance with m ≤ pί ≤ M. In the online k-search problem, the seller seeks to find the k maximum out of the...

全面介紹

Saved in:
書目詳細資料
Main Authors: Clemente, Jhoirene B, Adorna, Henry N, Fernandez, Proceso L, Jr
格式: text
出版: Archīum Ateneo 2022
主題:
在線閱讀:https://archium.ateneo.edu/discs-faculty-pubs/343
https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1343&context=discs-faculty-pubs
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Ateneo De Manila University