ON PATHS IN SEARCH OR DECISION TREES WHICH REQUIRE ALMOST WORST-CASE TIME

被引：0
|
作者：
HUCKENBECK, U
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 344卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：406 / 423
页数：18
相关论文
共 50 条
  • [21] A classical decision theoretic perspective on worst-case analysis
    Moshe Sniedovich
    Applications of Mathematics, 2011, 56 : 499 - 509
  • [22] A CLASSICAL DECISION THEORETIC PERSPECTIVE ON WORST-CASE ANALYSIS
    Sniedovich, Moshe
    APPLICATIONS OF MATHEMATICS, 2011, 56 (05) : 499 - 509
  • [23] WORST-CASE MINIMUM RECTILINEAR STEINER TREES IN ALL DIMENSIONS
    SNYDER, TL
    DISCRETE & COMPUTATIONAL GEOMETRY, 1992, 8 (01) : 73 - 92
  • [24] Worst-case portfolio optimization in discrete time
    Chen, Lihua
    Korn, Ralf
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2019, 90 (02) : 197 - 227
  • [25] Worst-case portfolio optimization in discrete time
    Lihua Chen
    Ralf Korn
    Mathematical Methods of Operations Research, 2019, 90 : 197 - 227
  • [26] Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time
    Mao, Xiao
    PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 1141 - 1152
  • [27] Fully dynamic all-pairs shortest paths with worst-case update-time revisited
    Abraham, Ittai
    Chechik, Shiri
    Krinninger, Sebastian
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 440 - 452
  • [28] An efficient search algorithm of worst-case cache flush timings
    Miyamoto, H
    Iiyama, S
    Tomiyama, H
    Takada, H
    Nakashima, H
    11TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2005, : 45 - 52
  • [29] The Role of Worst-Case Scenarios in Sponsors' and Regulators' Decision Making
    Turner, J. Rick
    THERAPEUTIC INNOVATION & REGULATORY SCIENCE, 2019, 53 (01) : 5 - 7
  • [30] Deterministic Dynamic Matching in Worst-Case Update Time
    Peter Kiss
    Algorithmica, 2023, 85 : 3741 - 3765
12345