Suchergebnisse - F.2.2 [Analysis of Algorithms and Problem Complexity]: Non-numerical Algorithms and Problems

Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems von 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 …”
Volltext

Quantum algorithms and complexity for numerical problems von Zhang, Chi

“… Quantum algorithms can solve certain problems significantly faster than classical algorithms …”
Volltext

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

“… It turns out, however, that computational problems in quantum mechanics are notoriously difficult to treat numerically …”
Volltext

Numerical analysis of non-Newtonian TEHL line contact problem based on real-coded genetic algorithm von 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 …”
Volltext

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

“… The single-item lot sizing problem under a periodic energy limitation is considered in this paper …”
Volltext

Numerical algorithms for diffusion–reaction problems with non-classical conditions von 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 …”
Volltext

Computational Complexity Analysis of Ant Colony Clustering Algorithms: Application to Student's Grouping Problem von 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 …”
Volltext

The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis von 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 …”
Volltext

Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems von 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 …”
Volltext

An implicit numerical algorithm for solving non-hydrostatic free-surface flow problems von 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 …”
Volltext

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

“… We then analyze the complexity of counting the number of feasible solutions of a well known PDP, and of a related scheduling problem, and we show that both problems are hard, namely, #Pcomplete …”
Volltext

Algorithms and complexity analysis for some network design problems von 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 …”
Volltext

Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems von 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 …”
Volltext

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

“… In this paper, we study a robust single-machine scheduling problem under four alternative optimization criteria …”
Volltext

Complexity analysis and algorithms for the Program Download Problem von 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 …”
Volltext

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

“… They also pointed out that it was an open problem to determine the computational complexity of the pooling problem with a fixed number of qualities …”
Volltext

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

“… The main focus of this dissertation is on classical combinatorial optimization problems in two important areas …”
Volltext

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

“… The parabolic problems with non-classical conditions are discussed in a reproducing kernel space in this paper …”
Volltext

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

“… In this article, we solve numerically singularly perturbed non-linear autonomous initial-value problems (IVPs …”
Volltext

Description and Solution of an Unreported Intrinsic Bias in Photon Mapping Density Estimation with Constant Kernel von García, R., Ureña, C., Sbert, M.

“… This paper presents an analysis of the irradiance estimator often used in photon mapping algorithms and concludes that the classical approach with a constant kernel overestimates the correct value …”
Volltext