Suchergebnisse - polynomial-time (dynamic OR dynamika) programming algorithms*

Andere Suchmöglichkeiten:

  • Treffer 1 - 8 von 8
Treffer weiter einschränken
  1. 1

    Variations on RNA folding and alignment: lessons from Benasque von Bompfünewerer, Athanasius F., Backofen, Rolf, Bernhart, Stephan H., Hertel, Jana, Hofacker, Ivo L., Stadler, Peter F., Will, Sebastian

    ISSN: 0303-6812, 1432-1416
    Veröffentlicht: Berlin/Heidelberg Springer-Verlag 01.01.2008
    Veröffentlicht in Journal of mathematical biology (01.01.2008)
    “… Dynamic programming algorithms solve many standard problems of RNA bioinformatics in polynomial time …”
    Volltext
    Journal Article
  2. 2

    On the Approximation of Optimal Structures for RNA-RNA Interaction von Mneimneh, S.

    ISSN: 1545-5963, 1557-9964, 1557-9964
    Veröffentlicht: United States IEEE 01.10.2009
    “… Most of the proposed algorithms are based on dynamic programming. RNA-RNA interaction is generally NP-complete …”
    Volltext
    Journal Article
  3. 3

    Scalable Approaches to Time-Dependent Path and Routing Problems von He, Edward Yuhang

    ISBN: 9798265401441
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.2021
    “… Many combinatorial optimization problems involve an aspect of time, whether due to changing conditions, updated information, or being under a continuous …”
    Volltext
    Dissertation
  4. 4

    Rapid ab initio prediction of RNA pseudoknots via graph tree decomposition von Zhao, Jizhen, Malmberg, Russell L., Cai, Liming

    ISSN: 0303-6812, 1432-1416
    Veröffentlicht: Berlin/Heidelberg Springer-Verlag 01.01.2008
    Veröffentlicht in Journal of mathematical biology (01.01.2008)
    “… Optimal algorithms often assume a restricted class for the predicted RNA structures and yet still require a high-degree polynomial time complexity, which is too expensive to use …”
    Volltext
    Journal Article
  5. 5

    Topics in Discrete Optimization: Models, Complexity and Algorithms von He, Qie

    ISBN: 9798263364274
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.2013
    “… The prevalent presence of dynamics and uncertainties imposes even greater challenges on both tasks …”
    Volltext
    Dissertation
  6. 6

    Static Risk Sensitive Reinforcement Learning von Hau, Jia Lin

    ISBN: 9798286493593
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.2025
    “… Reinforcement Learning (RL) is a core area of artificial intelligence (AI) that enables systems to make decisions in complex environments. RL algorithms have …”
    Volltext
    Dissertation
  7. 7

    A Framework for Efficient Implementation and Effective Visualization of Dempster-Shafer Belief Theoretic Computations for Reasoning under Uncertainty von Polpitiya, Lalintha G

    ISBN: 1085672832, 9781085672832
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.2019
    “… The convenience, intuitiveness, and versatility of Dempster-Shafer (DS) theoretic models of data uncertainty make DS evidence theory an ideal framework for …”
    Volltext
    Dissertation
  8. 8

    ALGORITHMS FOR SELECTING BREAKPOINT LOCATIONS TO OPTIMIZE DIVERSITY IN PROTEIN ENGINEERING BY SITE-DIRECTED PROTEIN RECOMBINATION von Zheng, Wei, Ye, Xiaoduan, Friedman, Alan M., Bailey-Kellogg, Chris

    ISBN: 1860948723, 9781860948725, 1860948731, 1908979097, 9781860948732, 9781908979094
    ISSN: 1752-7791
    Veröffentlicht: United States PUBLISHED BY IMPERIAL COLLEGE PRESS AND DISTRIBUTED BY WORLD SCIENTIFIC PUBLISHING CO 2007
    Veröffentlicht in Computational Systems Bioinformatics (2007)
    “… Protein engineering by site-directed recombination seeks to develop proteins with new or improved function, by accumulating multiple mutations from a set of …”
    Volltext
    Buchkapitel Journal Article