Výsledky vyhľadávania - (abstraktu OR abstracts) computational complexity for mathematical programming problems*

  • Zobrazené výsledky 1 - 19 z 19
Upresniť hľadanie
  1. 1

    Two Projection Neural Networks With Reduced Model Complexity for Nonlinear Programming Autor Xia, Youshen, Wang, Jun, Guo, Wenzhong

    ISSN: 2162-237X, 2162-2388, 2162-2388
    Vydavateľské údaje: United States IEEE 01.06.2020
    “…) for solving nonlinear programming (NP) problems. Compared with existing projection neural networks for solving NP, the proposed two RDPNNs have a low-dimensional state space and low model complexity…”
    Získať plný text
    Journal Article
  2. 2

    Treewidth-based algorithms for the small parsimony problem on networks Autor Scornavacca, Celine, Weller, Mathias

    ISSN: 1748-7188, 1748-7188
    Vydavateľské údaje: London BioMed Central 20.08.2022
    Vydané v Algorithms for molecular biology (20.08.2022)
    “…Background Phylogenetic reconstruction is one of the paramount challenges of contemporary bioinformatics. A subtask of existing tree reconstruction algorithms…”
    Získať plný text
    Journal Article
  3. 3

    Evolutionary programming as a platform for in silico metabolic engineering Autor Patil, Kiran Raosaheb, Rocha, Isabel, Förster, Jochen, Nielsen, Jens

    ISSN: 1471-2105, 1471-2105
    Vydavateľské údaje: England BioMed Central 23.12.2005
    Vydané v BMC bioinformatics (23.12.2005)
    “… However, owing to the complexity of metabolic networks, both in terms of structure and regulation, it is often difficult to predict the effects of genetic modifications on the resulting phenotype…”
    Získať plný text
    Journal Article
  4. 4

    A Parallel DNA Algorithm for Solving the Quota Traveling Salesman Problem Based on Biocomputing Model Autor Wang, Zhaocai, Wu, Xian, Wu, Tunhua

    ISSN: 1687-5265, 1687-5273, 1687-5273
    Vydavateľské údaje: New York Hindawi 31.08.2022
    “… Its time complexity is On2+Q, which is a significant improvement over previous algorithms with exponential complexity…”
    Získať plný text
    Journal Article
  5. 5

    Strengthening convex relaxations of 0/1-sets using Boolean formulas Autor Fiorini, Samuel, Huynh, Tony, Weltge, Stefan

    ISSN: 0025-5610, 1436-4646
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2021
    Vydané v Mathematical programming (01.11.2021)
    “…In convex integer programming, various procedures have been developed to strengthen convex relaxations of sets of integer points…”
    Získať plný text
    Journal Article
  6. 6

    A hybrid approach to protein folding problem integrating constraint programming with local search Autor Ullah, Abu Dayem, Steinhöfel, Kathleen

    ISSN: 1471-2105, 1471-2105
    Vydavateľské údaje: London BioMed Central 18.01.2010
    Vydané v BMC bioinformatics (18.01.2010)
    “…Background The protein folding problem remains one of the most challenging open problems in computational biology…”
    Získať plný text
    Journal Article
  7. 7

    Sequoya: multiobjective multiple sequence alignment in Python Autor Benítez-Hidalgo, Antonio, Nebro, Antonio J, Aldana-Montes, José F

    ISSN: 1367-4803, 1367-4811, 1460-2059, 1367-4811
    Vydavateľské údaje: England Oxford University Press 01.06.2020
    Vydané v Bioinformatics (01.06.2020)
    “…Abstract Motivation Multiple sequence alignment (MSA) consists of finding the optimal alignment of three or more biological sequences to identify highly…”
    Získať plný text
    Journal Article
  8. 8

    Maximum-scoring path sets on pangenome graphs of constant treewidth Autor Brejová, Broňa, Gagie, Travis, Herencsárová, Eva, Vinař, Tomáš

    ISSN: 2673-7647, 2673-7647
    Vydavateľské údaje: Switzerland Frontiers Media S.A 01.07.2024
    Vydané v Frontiers in bioinformatics (01.07.2024)
    “… (IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004, 1, 139–150), from sequences to graphs…”
    Získať plný text
    Journal Article
  9. 9

    Automated generation of heuristics for biological sequence comparison Autor Slater, Guy St C, Birney, Ewan

    ISSN: 1471-2105, 1471-2105
    Vydavateľské údaje: England BioMed Central 15.02.2005
    Vydané v BMC bioinformatics (15.02.2005)
    “…Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement…”
    Získať plný text
    Journal Article
  10. 10

    An Improved Simulated Annealing-Based Decision Model for the Hybrid Flow Shop Scheduling of Aviation Ordnance Handling Autor Meng, Xianglei, Wang, Nengjian, Liu, Jue, Liu, Qinhui

    ISSN: 1687-5265, 1687-5273, 1687-5273
    Vydavateľské údaje: United States Hindawi 02.02.2022
    “… The complexity of the problem depends on the supply and demand features of ordnance. This paper examines the scheduling of aviation ordnance handling of an operational aircraft carrier under the framework of hybrid flow shop scheduling (HFS…”
    Získať plný text
    Journal Article
  11. 11

    Direct heuristic dynamic programming based on an improved PID neural network Autor Sun, Jian, Liu, Feng, Si, Jennie, Mei, Shengwei

    ISSN: 1672-6340, 1993-0623
    Vydavateľské údaje: Heidelberg South China University of Technology and Academy of Mathematics and Systems Science, CAS 01.11.2012
    “…In this paper, an improved PID-neural network (IPIDNN) structure is proposed and applied to the critic and action networks of direct heuristic dynamic programming (DHDP…”
    Získať plný text
    Journal Article
  12. 12

    A comparison of synthesis methods for cellular structures with application to additive manufacturing Autor Chu, Jane, Engelbrecht, Sarah, Graf, Gregory, Rosen, David W.

    ISSN: 1355-2546, 1758-7670
    Vydavateľské údaje: Bradford Emerald Group Publishing Limited 15.06.2010
    Vydané v Rapid prototyping journal (15.06.2010)
    “…) and Levenburg-Marquardt (LM), based on a least-squares minimization formulation. Two example problems of limited complexity, specifically a two-dimensional cantilever beam and a two-dimensional simply-supported plate, were investigated…”
    Získať plný text
    Journal Article
  13. 13

    A Note on Probabilistic Models over Strings: The Linear Algebra Approach Autor Bouchard-Côté, Alexandre

    ISSN: 0092-8240, 1522-9602, 1522-9602
    Vydavateľské údaje: New York Springer US 01.12.2013
    Vydané v Bulletin of mathematical biology (01.12.2013)
    “… There is an extensive literature on using automata and transducers on phylogenies to do inference on these probabilistic models, in which an important theoretical question is the complexity…”
    Získať plný text
    Journal Article
  14. 14

    Modeling and solving the multi-objective energy-efficient production planning and scheduling with imperfect maintenance activities Autor Rastgar, Iman, Rezaeian, Javad, Mahdavi, Iraj, Fattahi, Parviz

    ISSN: 1355-2511, 1758-7832
    Vydavateľské údaje: Bradford Emerald Publishing Limited 23.02.2024
    “…) are developed to address the high complexity of large-scale problems.FindingsThe computational results demonstrate that the metaheuristic algorithms are effective in obtaining economic solutions within a reasonable…”
    Získať plný text
    Journal Article
  15. 15

    The multi resource leveling and materials procurement problem: an integrated approach Autor Almatroushi, Hessa, Hariga, Moncer, As'ad, Rami, Al-Bar, AbdulRahman

    ISSN: 0969-9988, 1365-232X
    Vydavateľské údaje: Bradford Emerald Publishing Limited 08.10.2020
    “… problems.Design/methodology/approachA mixed integer linear programming model is devised, which utilizes the splitting of noncritical activities as a mean toward leveling the renewable resources…”
    Získať plný text
    Journal Article
  16. 16

    Deterministic global optimization for FNN training Autor Toh, K.-A.

    ISSN: 1083-4419
    Vydavateľské údaje: United States IEEE 01.12.2003
    “…This paper addresses the issue of training feedforward neural networks by global optimization. The main contributions include characterization of global…”
    Získať plný text
    Journal Article
  17. 17

    Residue-rotamer-reduction algorithm for the protein side-chain conformation problem Autor Xie, Wei, Sahinidis, Nikolaos V.

    ISSN: 1367-4803, 1460-2059, 1367-4811
    Vydavateľské údaje: Oxford Oxford University Press 15.01.2006
    Vydané v Bioinformatics (15.01.2006)
    “… Computational complexity results show that the problem is hard to solve. Yet, instances from realistic applications are large and demand fast and reliable algorithms. Results…”
    Získať plný text
    Journal Article
  18. 18

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

    ISBN: 9798265401441
    Vydavateľské údaje: 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…”
    Získať plný text
    Dissertation
  19. 19

    Software and Algorithms for Large-Scale Seismic Inverse Problems Autor Witte, Philipp A

    ISBN: 9798263379889
    Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.2020
    “…Seismic imaging and parameter estimation are an import class of inverse problemswith practical relevance in resource exploration, carbon control and monitoring systemsfor geohazards…”
    Získať plný text
    Dissertation