Suchergebnisse - (abstract OR abstraktys) computational complexity for mathematical programming problems*

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

“… ) 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 …”
Volltext

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

“… Background Phylogenetic reconstruction is one of the paramount challenges of contemporary bioinformatics. A subtask of existing tree reconstruction algorithms …”
Volltext

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

“… 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 …”
Volltext

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

“… Its time complexity is On2+Q, which is a significant improvement over previous algorithms with exponential complexity …”
Volltext

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

“… In convex integer programming, various procedures have been developed to strengthen convex relaxations of sets of integer points …”
Volltext

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

“… Background The protein folding problem remains one of the most challenging open problems in computational biology …”
Volltext

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

“… Abstract Motivation Multiple sequence alignment (MSA) consists of finding the optimal alignment of three or more biological sequences to identify highly …”
Volltext

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

“… (IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004, 1, 139–150), from sequences to graphs …”
Volltext

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

“… Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement …”
Volltext

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

“… 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 …”
Volltext

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

“… 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 …”
Volltext

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

“… ) 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 …”
Volltext

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

“… 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 …”
Volltext

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

“… ) 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 …”
Volltext

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

“… 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 …”
Volltext

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

“… This paper addresses the issue of training feedforward neural networks by global optimization. The main contributions include characterization of global …”
Volltext

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

“… 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 …”
Volltext

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

“… Many combinatorial optimization problems involve an aspect of time, whether due to changing conditions, updated information, or being under a continuous …”
Volltext

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

“… Seismic imaging and parameter estimation are an import class of inverse problemswith practical relevance in resource exploration, carbon control and monitoring systemsfor geohazards …”
Volltext