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 条
  • [1] Protein design is NP-hard
    Pierce, NA
    Winfree, E
    PROTEIN ENGINEERING, 2002, 15 (10): : 779 - 782
  • [2] Variational genetic algorithm for NP-hard scheduling problem solution
    Diveev, A. I.
    Bobr, O. V.
    XII INTERNATIONAL SYMPOSIUM INTELLIGENT SYSTEMS 2016, (INTELS 2016), 2017, 103 : 52 - 58
  • [3] The string barcoding problem is NP-hard
    Dalpasso, M
    Lancia, G
    Rizzi, R
    COMPARATIVE GENOMICS, 2005, 3678 : 88 - 96
  • [4] THE STO-PROBLEM IS NP-HARD
    APT, KR
    BOAS, PV
    WELLING, A
    JOURNAL OF SYMBOLIC COMPUTATION, 1994, 18 (05) : 489 - 495
  • [5] Faster exact solutions for some NP-hard problems
    Drori, L
    Peleg, D
    THEORETICAL COMPUTER SCIENCE, 2002, 287 (02) : 473 - 499
  • [6] An Improved Ants Colony Algorithm for NP-hard Problem of Travelling Salesman
    Luo Yabo
    Zhang, Shikun
    Feng, Zhang
    PERVASIVE COMPUTING AND THE NETWORKED WORLD, 2014, 8351 : 432 - 440
  • [7] A Fast And Optimal Deterministic Algorithm For NP-Hard Antenna Selection Problem
    Iqbal, Naveed
    Schneider, Christian
    Thom, Reiner S.
    2015 IEEE 26TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR, AND MOBILE RADIO COMMUNICATIONS (PIMRC), 2015, : 895 - 899
  • [8] Faster exact solutions for some NP-hard problems (extended abstract)
    Drori, L
    Peleg, D
    ALGORITHMS - ESA'99, 1999, 1643 : 450 - 461
  • [9] The Planar k-Means Problem is NP-Hard
    Mahajan, Meena
    Nimbhorkar, Prajakta
    Varadarajan, Kasturi
    WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5431 : 274 - +
  • [10] The planar k-means problem is NP-hard
    Mahajan, Meena
    Nimbhorkar, Prajakta
    Varadarajan, Kasturi
    THEORETICAL COMPUTER SCIENCE, 2012, 442 : 13 - 21
12345