Výsledky vyhledávání - Analysis of Algorithms and Problem Complexity—Non-numerical Algorithms and Problems General Terms

Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems Autor Achache, Mohamed

“…In this paper we deal with the study of the polynomial complexity and numerical implementation for a short-step primal-dual interior point algorithm for monotone linear complementarity problems LCP…”
Získat plný text

Quantum algorithms and complexity for numerical problems Autor Zhang, Chi

“… Quantum algorithms can solve certain problems significantly faster than classical algorithms…”
Získat plný text

On the complexity of classical and quantum algorithms for numerical problems in quantum mechanics Autor Bessen, Arvid J

“… It turns out, however, that computational problems in quantum mechanics are notoriously difficult to treat numerically…”
Získat plný text

Numerical analysis of non-Newtonian TEHL line contact problem based on real-coded genetic algorithm Autor Qiu, M., Lu, J., Yin, Y.

“…) line contact problem based on real-coded genetic algorithm (RGA). To solve the line contact TEHL problem by means of RGA, the initial population producing method…”
Získat plný text

Energy-aware lot sizing problem: Complexity analysis and exact algorithms Autor Rapine, Christophe, Goisque, Guillaume, Akbalik, Ayse

“…The single-item lot sizing problem under a periodic energy limitation is considered in this paper…”
Získat plný text

Numerical algorithms for diffusion–reaction problems with non-classical conditions Autor Martín-Vaquero, J., Queiruga-Dios, A., Encinas, A.H.

“… In this paper new high-order algorithms for the linear diffusion–reaction problem are derived…”
Získat plný text

The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis Autor LaRusic, John, Punnen, Abraham P.

“… Various lower bound algorithms are proposed and the relative strengths of each of these bounds are examined using theoretical and experimental analysis. A polynomial time ⌈n/2…”
Získat plný text

Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems Autor Bergou, El Houcine, Diouane, Youssef, Kungurtsev, Vyacheslav

“…The Levenberg–Marquardt algorithm is one of the most popular algorithms for finding the solution of nonlinear least squares problems…”
Získat plný text

Computational Complexity Analysis of Ant Colony Clustering Algorithms: Application to Student's Grouping Problem Autor Chniter, Malak, Abid, Abir, Kallel, Ilhem, Kanoun, Slim

“…The task of assessing, grouping and arranging data into meaningful groups or clusters based on their similarities/dissimilarities measures known as cluster analysis…”
Získat plný text

An implicit numerical algorithm for solving non-hydrostatic free-surface flow problems Autor Namin, M. M., Lin, B., Falconer, R. A.

“… An efficient numerical algorithm has been developed, deploying implicit parameters similar to those used in the Crank…”
Získat plný text

Algorithms and complexity analyses for some combinatorial optimization problems Autor Zhao, Hairong

“…The main focus of this dissertation is on classical combinatorial optimization problems in two important areas…”
Získat plný text

Algorithms and complexity analysis for some network design problems Autor Nguyen, Thanh-Nhan Thi

“… on these problems, and an approximation algorithm to a new access network design problem. In particular, the three problems can briefly be described as follows…”
Získat plný text

Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems Autor Watanabe, T.

“…The paper shows summary of the author's research subjects from 1973 through 2012. Additional explanation on these subjects and related references are omitted…”
Získat plný text

Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems Autor Tadayon, Bita, Smith, J. Cole

“…In this paper, we study a robust single-machine scheduling problem under four alternative optimization criteria…”
Získat plný text

Complexity Analysis and Algorithm Design of Pooling Problem Autor Dai, Yu-Hong, Diao, Rui, Fu, Kai

“… However, Alfaki and Haugland (J Glob Optim 56:897–916, 2013 ) proved the strong NP-hardness of the pooling problem in general case…”
Získat plný text

Complexity Analyses and Algorithms for Pickup and Delivery Problems Autor Berbeglia, Gerardo

“…Pickup and Delivery Problems (PDPs) are a relevant class of vehicle routing problems in which objects or people need to be collected and distributed…”
Získat plný text

Complexity analysis and algorithms for the Program Download Problem Autor Peng, Chao, Zhou, Jie, Zhu, Binhai, Zhu, Hong

“…In this paper, we consider the Program Download Problem (PDP) which is to download a set of desired programs from multiple channels…”
Získat plný text

Numerical algorithm for parabolic problems with non-classical conditions Autor Zhou, Yongfang, Cui, Minggen, Lin, Yingzhen

“…The parabolic problems with non-classical conditions are discussed in a reproducing kernel space in this paper…”
Získat plný text

Numerical solution of nonlinear singularly perturbed problems by using a non-standard algorithm on variable stepsize implementation (CMMSE–2009) Autor Ramos, Higinio, García-Rubio, R.

“…In this article, we solve numerically singularly perturbed non-linear autonomous initial-value problems (IVPs…”
Získat plný text

On convergence and complexity analysis of an accelerated forward–backward algorithm with linesearch technique for convex minimization problems and applications to data prediction and classification Autor Sarnmeta, Panitarn, Inthakon, Warunun, Chumpungam, Dawan, Suantai, Suthep

“…In this work, we introduce a new accelerated algorithm using a linesearch technique for solving convex minimization problems in the form of a summation of two lower semicontinuous convex functions…”
Získat plný text