Výsledky vyhľadávania - Analysis of Algorithms and Problem Complexity—Nonnumerical Algorithms and Problems~

Mandatory Critical Points of 2D Uncertain Scalar Fields Autor Günther, David, Salmon, Joseph, Tierny, Julien

“… The characterization is based on the analysis of the support of the probability density functions (PDF) of the input data. Given two scalar fields representing reliable estimations…”
Získať 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ískať 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ískať 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ískať 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ískať 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ískať 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ískať 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ískať 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ískať plný text

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

“…The pooling problem, also called the blending problem, is fundamental in production planning of petroleum…”
Získať 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ískať 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ískať plný text

Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams Autor Bennett, H., Papadopoulou, E., Yap, C.

“… We describe a subdivision algorithm for computing a clustered ε‐isotopic approximation of the minimization diagram of X…”
Získať 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ískať plný text

Complexity analysis and algorithms for the Inter Cell Interference Coordination with fixed transmit powers problem Autor Nambiar, Ashwathi, Kasbekar, Gaurav S.

“…We study the Inter Cell Interference Coordination problem in a multi-cell OFDMA based cellular network employing universal frequency reuse…”
Získať plný text

Complexity analysis and approximation algorithms for the single-machine scheduling problem with workload-dependent maintenance activities Autor Liu, Peihai, Gu, Manzhan, Lu, Xiwen

“… completion time, respectively. In addition, we propose a 2-approximation algorithm for the first problem…”
Získať plný text

The U-curve optimization problem: improvements on the original algorithm and time complexity analysis Autor Reis, Marcelo S, Ferreira, Carlos E, Barrera, Junior

“… Recently, the U-Curve algorithm was proposed to give optimal solutions to the U-curve problem…”
Získať plný text

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ískať plný text

Time Complexity Analysis of Evolutionary Algorithms for 2-Hop (1,2)-Minimum Spanning Tree Problem Autor Shi, Feng, Neumann, Frank, Wang, Jianxin

“… of evolutionary algorithms. Within the paper, we consider a constrained version of the problem named 2-Hop (1,2…”
Získať plný text

Superlinear algorithms for LP and LCP problems with their complexity analysis Autor Ji, Jun

“…This thesis is part of a program to gain a better understanding of some interior point algorithms for linear programming and linear complementarity problems emphasizing on superlinear convergence…”
Získať plný text