位置：成果数据库 > 会议 > 会议详情页
Optimal Algorithms for the Online Time Series Search Problem
  • 所属机构名称：西安交通大学
  • 会议名称：3rd International Conference on Combinatorial Optimization and Applications
  • 成果类型：会议
  • 会场：Huangshan, PEOPLES R CHINA
  • 相关项目：优化理论与技术
作者： Zheng, Feifeng|Zhang, Wenming|Xu, Yinfeng|
同会议论文项目
优化理论与技术
期刊论文 72 会议论文 11 获奖 2
同项目会议论文
How can adversary design two sequential blockages efficiently?
The Gradation Model of Unexpected Accidents in the Tertiary Institutions
Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine
A Risk-Reward Competitive Analysis for the Newsboy Problem with Range Information
A risk-reward competitive analysis for the Recoverable Canadian Traveller Problem
An optimal strategy for online non-uniform length order scheduling
On the on-line rental problem with risk and probabilistic forecast
On Job Scheduling with Preemption Penalties
Online dial-a-ride problem with time-windows under a restricted information model
Real time critical edge of the shortest path in transportation networks