Výsledky vyhledávání - Analysis of algorithms AND problems complexity*

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

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

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

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

Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions Autor Larsson, Thomas, Källberg, Linus

“…In this paper, an algorithm is introduced that computes an arbitrarily fine approximation of the smallest enclosing ball of a point set in any dimension…”
Získat 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ískat plný text

Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems Autor Le Gall, François, Seddighin, Saeed

“…) are three fundamental string problems that can be classically solved in near linear time. In this work, we present sublinear time quantum algorithms for these problems along with quantum lower bounds…”
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

Algorithms and Complexity on Indexing Founder Graphs Autor Equi, Massimo, Norri, Tuukka, Alanko, Jarno, Cazaux, Bastien, Tomescu, Alexandru I., Mäkinen, Veli

“…We study the problem of matching a string in a labeled graph. Previous research has shown that unless the Orthogonal Vectors Hypothesis (OVH…”
Získat plný text

On the Parameterized Complexity of Reconfiguration Problems Autor Mouawad, Amer E., Nishimura, Naomi, Raman, Venkatesh, Simjour, Narges, Suzuki, Akira

“…We present the first results on the parameterized complexity of reconfiguration problems, where a reconfiguration variant of an optimization problem Q takes as input two feasible solutions S and T…”
Získat plný text

A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints Autor Nip, Kameng, Wang, Zhenbo

“… We study the computational complexity and propose polynomial-time optimal or approximation algorithms…”
Získat plný text

Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization Autor Gomes, Guilherme C. M., Sau, Ignasi

“… The Matching Cut problem asks whether a graph has a matching cut, and has been intensively studied in the literature…”
Získat plný text

Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity Autor Foucaud, Florent, Mertzios, George B., Naserasr, Reza, Parreau, Aline, Valicov, Petru

“…We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets…”
Získat plný text

Correction: On the Parameterized Complexity of Controlling Amendment and Successive Winners Autor Yang, Yongjie

Získat plný text

On the Computational Complexity of Vertex Integrity and Component Order Connectivity Autor Drange, Pål Grønås, Dregi, Markus, van ’t Hof, Pim

“…The Weighted Vertex Integrity (wVI) problem takes as input an n -vertex graph G , a weight function w : V ( G…”
Získat plný text

Upward Book Embeddability of st-Graphs: Complexity and Algorithms Autor Binucci, Carla, Da Lozzo, Giordano, Di Giacomo, Emilio, Didimo, Walter, Mchedlidze, Tamara, Patrignani, Maurizio

“… The k UBE Testing problem, which asks whether a graph admits a k UBE, was introduced in 1999 by Heath, Pemmaraju, and Trenk (SIAM J Comput 28(4), 1999…”
Získat plný text

Optimal Static and Self-Adjusting Parameter Choices for the (1+(λ,λ)) Genetic Algorithm Autor Doerr, Benjamin, Doerr, Carola

“…The ( 1 + ( λ , λ ) )  genetic algorithm proposed in Doerr et al. (Theor Comput Sci 567:87–104, 2015…”
Získat plný text

Parameterized Complexity of Path Set Packing Autor Aravind, N. R., Saxena, Roopam

“… . The problem is to decide whether there exist k edge-disjoint paths in . We study the parameterized complexity of Path Set Packing with respect to both natural and structural parameters…”
Získat plný text

A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems Autor Chen, Yu, Kuang, Kai, Yan, Xueling

“… Additionally, the complexity analysis of the proposed algorithm is investigated. To reach the point with the norm of the gradient below ɛ…”
Získat plný text

Unique Response Roman Domination: Complexity and Algorithms Autor Banerjee, Sumanta, Chaudhary, Juhi, Pradhan, Dinabandhu

“…A function f : V ( G ) → { 0 , 1 , 2 } is called a Roman dominating function on G = ( V ( G ) , E ( G ) ) if for every vertex v with f ( v ) = 0 , there exists…”
Získat plný text