首页> 外文会议>Fun with algorithms >Return of the Boss Problem: Competing Online against a Non-adaptive Adversary
【24h】

Return of the Boss Problem: Competing Online against a Non-adaptive Adversary

机译:老板问题的回归:与非自适应对手在线竞争

获取原文
获取原文并翻译 | 示例

摘要

We follow the travails of Enzo the baker, Orsino the oven man, and Beppe the planner. Their situation have a common theme: They know the input, in the form of a sequence of items, and they are not computationally constrained. Their issue is that they don't know in advance the time of reckoning, i.e. when their boss might show up, when they will be measured in terms of their progress on the prefix of the input sequence seen so far. Their goal is therefore to find a particular solution whose size on any prefix of the known input sequence is within best possible performance guarantees.
机译:我们跟随面包师恩佐(Enzo),烤箱人奥尔西诺(Orsino)和计划者贝贝(Beppe)的辛苦工作。他们的处境有一个共同的主题:他们知道输入的形式是一连串的项目,并且不受计算的限制。他们的问题是他们事先不知道清算的时间,即他们的老板何时出现,何时根据到目前为止在输入序列的前缀上的进度来衡量他们。因此,他们的目标是找到一种特定的解决方案,该解决方案在已知输入序列的任何前缀上的大小都在可能的最佳性能保证之内。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号