A computationally faster randomized algorithm for NP-hard controller design problem

被引：0
|
作者：
Moses, M. Jerome [1 ]
Ramakalyan, Ayyagari [1 ]
机构：
[1] Moses, M. Jerome
[2] Ramakalyan, Ayyagari
来源：
| 1600年 / Springer Verlag卷 / 235期
关键词：
5;
D O I：
10.1007/978-3-319-01778-5_42
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：411 / 417
相关论文
共 50 条
  • [31] The computation of the Betti numbers of an elliptic space is a NP-hard problem
    Garvín, A
    Lechuga, L
    TOPOLOGY AND ITS APPLICATIONS, 2003, 131 (03) : 235 - 238
  • [32] Minimum constraint removal problem for line segments is NP-hard
    Bigham, Bahram Sadeghi
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2023, 15 (01)
  • [33] The proton arc therapy treatment planning problem is NP-Hard
    Wase, Viktor
    Wuyckens, Sophie
    Lee, John A.
    Saint-Guillain, Michael
    COMPUTERS IN BIOLOGY AND MEDICINE, 2024, 171
  • [34] THE MINIMUM-LENGTH GENERATOR SEQUENCE PROBLEM IS NP-HARD
    EVEN, S
    GOLDREICH, O
    JOURNAL OF ALGORITHMS, 1981, 2 (03) : 311 - 313
  • [35] Checking identities is computationally intractable NP-hard and therefore human provers will always be needed
    Kreinovich, V
    Tao, CW
    INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 2004, 19 (1-2) : 39 - 49
  • [36] A machine learning approach to algorithm selection for NP-hard optimization problems: a case study on the MPE problem
    Guo, Haipeng
    Hsu, William H.
    ANNALS OF OPERATIONS RESEARCH, 2007, 156 (01) : 61 - 82
  • [37] ALLOCATING HARD REAL-TIME TASKS - AN NP-HARD PROBLEM MADE EASY
    TINDELL, KW
    BURNS, A
    WELLINGS, AJ
    REAL-TIME SYSTEMS, 1992, 4 (02) : 145 - 165
  • [38] What is the Right Context for an Engineering Problem: Finding Such a Context is NP-Hard
    Ceberio, Martine
    Kreinovich, Vladik
    Nguyen, Hung T.
    Sriboonchitta, Songsak
    Ouncharoen, Rujira
    2015 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI), 2015, : 1621 - 1626
  • [39] SPACE-TIME ISOMORPHISM-PROBLEM IS INTRACTABLE (NP-HARD)
    KREINOVICH, V
    INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 1991, 30 (09) : 1249 - 1257
  • [40] On the Solution of the Steiner Tree NP-Hard Problem via Physarum BioNetwork
    Caleffi, Marcello
    Akyildiz, Ian F.
    Paura, Luigi
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2015, 23 (04) : 1092 - 1106
12345