We also give a practical online algorithm with better competitive ratio for small K’s. We give new definitions for the notion of look-ahead to better suit algorithms for natural online problems with look-ahead.
我们还给出了一个对较小的K有更好竞争比的实用算法。 本文中我们重新定义了在线算法中前瞻的概念,使其更适合于自然带前瞻的在线问题。
参考来源 - 带前瞻的在线最大化问题Asfor the auction of digital goods, we have the following results:A truthful multi-price auction mechanism for digital goods auction is pro-posed, and the auctioneer’s competitive ratio is also given. Meanwhile, weinvestigate some properties of this mechanism.
本文在这方面的主要结果有:提出了数字产品拍卖中的一个带有需求量和附加费用的多价格随机拍卖机制,并讨论了它们的性质和拍卖人收益的竞争比。
参考来源 - 若干拍卖中的算法及复杂度研究·2,447,543篇论文数据，部分数据来源于NoteExpress
By normalizing the total processing time, we present an approximation algorithm and investigate its competitive ratio proved to be tight.
将总加工时间标准化后，给出近似算法及其竞争比，并证明此竞争比是紧的。
Discuss the means of deducing bidding models by linear regression and curve fit method, and further more, acquire rivals' bidding competitive ratio with fuzzy forecasting technique.
研究运用线性回归及曲线拟合手段推导投标报价模型的方法，并进一步运用模糊预测技术研究获取对手的竞标能力值。
The analysis of competitive ratio on scheduling problems is of great significance in both theory and practice since it is an evaluation and guarantee for the potential risk of an algorithm.
排序算法的竞争比分析是排序问题对算法风险的一种评估和保障，具有重要的理论意义和实用价值。
应用推荐