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 条
  • [41] Solution of the NP-hard total tardiness minimization problem in scheduling theory
    Lazarev A.A.
    Computational Mathematics and Mathematical Physics, 2007, 47 (6) : 1039 - 1049
  • [42] Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard
    Tunçel, L
    MATHEMATICAL PROGRAMMING, 1999, 86 (01) : 219 - 223
  • [43] CONVEX APPROXIMATION OF THE NP-HARD SEARCH PROBLEM IN FEATURE SUBSET SELECTION
    Naghibi, Tofigh
    Hoffmann, Sarah
    Pfister, Beat
    2013 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2013, : 3273 - 3277
  • [44] 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, : 1615 - 1620
  • [45] PREDICTION-PROBLEM IN QUANTUM-MECHANICS IS INTRACTABLE (NP-HARD)
    KREINOVICH, V
    VAZQUEZ, A
    KOSHELEVA, O
    INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 1991, 30 (02) : 113 - 122
  • [46] Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard
    Levent Tunçel
    Mathematical Programming, 1999, 86 : 219 - 223
  • [47] STUDY OF A NP-HARD CYCLIC SCHEDULING PROBLEM - THE RECURRENT JOB-SHOP
    HANEN, C
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 72 (01) : 82 - 101
  • [48] A Survey on Ant Colony Optimization for Solving Some of the Selected NP-Hard Problem
    Mandal, Akshaya Kumar
    Dehuri, Satchidananda
    BIOLOGICALLY INSPIRED TECHNIQUES IN MANY-CRITERIA DECISION MAKING, 2020, 10 : 85 - 100
  • [49] Is the Protein Model Assignment problem under linked branch lengths NP-hard?
    Koberta, Kassian
    Hauser, Joerg
    Stamatakis, Alexandros
    THEORETICAL COMPUTER SCIENCE, 2014, 524 : 48 - 58
  • [50] An alternative proof that exact inference problem in Bayesian belief networks is NP-hard
    Tacettin, M
    Ünlüyurt, T
    COMPUTER AND INFORMATION SCIENCES - ISCIS 2005, PROCEEDINGS, 2005, 3733 : 947 - 955
12345