Výsledky vyhľadávania - Complexity analysis of algorithms
-
1
Regional complexity analysis of algorithms for nonconvex smooth optimization
ISSN: 0025-5610, 1436-4646Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.05.2021Vydané v Mathematical programming (01.05.2021)“…A strategy is proposed for characterizing the worst-case performance of algorithms for solving nonconvex smooth optimization problems…”
Získať plný text
Journal Article -
2
Regional complexity analysis of algorithms for nonconvex smooth optimization
ISSN: 0025-5610, 1436-4646Vydavateľské údaje: United States Springer 01.04.2020Vydané v Mathematical programming (01.04.2020)“…Not provided…”
Získať plný text
Journal Article -
3
New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
ISSN: 0020-7160, 1029-0265Vydavateľské údaje: Abingdon Taylor & Francis 01.09.2012Vydané v International journal of computer mathematics (01.09.2012)“…] introduced the theory of complexity (quasi-metric) spaces as a part of the development of a topological foundation for the asymptotic complexity analysis of programs and algorithms in 1995…”
Získať plný text
Journal Article -
4
Scott’s Qualitative Fixed Point Technique in Complexity Analysis of Algorithms
ISSN: 2517-5718, 2517-5718Vydavateľské údaje: 08.01.2018Vydané v Advances in Computer Sciences (08.01.2018)Získať plný text
Journal Article -
5
A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms
ISSN: 0166-8641, 1879-3207Vydavateľské údaje: Elsevier B.V 15.04.2016Vydané v Topology and its applications (15.04.2016)“…In this paper we continue the study of fixed point theory in partial quasi-metric spaces and its usefulness in complexity analysis of algorithms…”
Získať plný text
Journal Article -
6
On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms
ISSN: 1687-1812, 1687-1812, 2730-5422Vydavateľské údaje: Cham Springer International Publishing 06.10.2015Vydané v Fixed point theory and algorithms for sciences and engineering (06.10.2015)“… Finally, the applicability of the exposed results is illustrated providing a methodology to determine the asymptotic upper bound of the complexity of those algorithms whose running time of computing…”
Získať plný text
Journal Article -
7
Editorial: Surveys in Algorithm Analysis and Complexity Theory, Part II (Special Issue)
ISSN: 1999-4893, 1999-4893Vydavateľské údaje: Basel MDPI AG 01.04.2025Vydané v Algorithms (01.04.2025)“…This is the second Special Issue of surveys published by the MDPI journal Algorithms [...]…”
Získať plný text
Journal Article -
8
Energy-aware lot sizing problem: Complexity analysis and exact algorithms
ISSN: 0925-5273, 1873-7579Vydavateľské údaje: Elsevier B.V 01.09.2018Vydané v International journal of production economics (01.09.2018)“…The single-item lot sizing problem under a periodic energy limitation is considered in this paper. Identical and parallel capacitated machines constitute the…”
Získať plný text
Journal Article -
9
Editorial: Surveys in Algorithm Analysis and Complexity Theory (Special Issue)
ISSN: 1999-4893, 1999-4893Vydavateľské údaje: Basel MDPI AG 30.03.2023Vydané v Algorithms (30.03.2023)“…This is a Special Issue of the open-access journal Algorithms consisting of surveys in theoretical computer science [...]…”
Získať plný text
Journal Article -
10
Puiseux series solutions of ODEs
ISSN: 1072-6691Vydavateľské údaje: Texas State University 15.05.2015Vydané v Electronic journal of differential equations (15.05.2015)“… We also study the binary complexity of computing such solutions. We will prove that this complexity bound is single exponential in the number of terms in the series…”
Získať plný text
Journal Article -
11
Regional Complexity Analysis of Algorithms for Nonconvex Smooth Optimization
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 24.08.2018Vydané v arXiv.org (24.08.2018)“…A strategy is proposed for characterizing the worst-case performance of algorithms for solving nonconvex smooth optimization problems…”
Získať plný text
Paper -
12
Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems
ISSN: 0022-3239, 1573-2878Vydavateľské údaje: New York Springer US 01.06.2020Vydané v Journal of optimization theory and applications (01.06.2020)“… Across different modified variations of the basic procedure, the algorithm enjoys global convergence, a competitive worst-case iteration complexity rate, and a guaranteed rate of local convergence…”
Získať plný text
Journal Article -
13
3D Urban UAV Relay Placement: Linear Complexity Algorithm and Analysis
ISSN: 1536-1276, 1558-2248Vydavateľské údaje: New York IEEE 01.08.2021Vydané v IEEE transactions on wireless communications (01.08.2021)“…Optimal unmanned aerial vehicle (UAV) placement in a 3-dimensional (3D) space to build a connection between a base station (BS) and a ground user is studied…”
Získať plný text
Journal Article -
14
On aggregation of normed structures
ISSN: 0895-7177, 1872-9479Vydavateľské údaje: Kidlington Elsevier Ltd 01.07.2011Vydané v Mathematical and computer modelling (01.07.2011)“…In 1981, Borsik and Doboš studied in depth the problem of how to merge, by means of a function, a collection (not necessarily finite) of distance spaces in…”
Získať plný text
Journal Article -
15
Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
ISSN: 0926-6003, 1573-2894Vydavateľské údaje: New York Springer US 01.01.2019Vydané v Computational optimization and applications (01.01.2019)“… A reason for this relatively low degree of popularity is the lack of a well developed system of theory and algorithms to support the applications, as is the case for its convex counterpart…”
Získať plný text
Journal Article -
16
The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis
ISSN: 0305-0548, 1873-765X, 0305-0548Vydavateľské údaje: Kidlington Elsevier Ltd 01.03.2014Vydané v Computers & operations research (01.03.2014)“… 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
Journal Article -
17
Complexity analysis of algorithms in algebraic computation
ISBN: 9781109858686, 110985868XVydavateľské údaje: ProQuest Dissertations & Theses 01.01.2007“…Numerical computations with real algebraic numbers require algorithms for isolating and approximating real roots of polynomials…”
Získať plný text
Dissertation -
18
Big-O Time Complexity Analysis Of Algorithm
Vydavateľské údaje: IEEE 26.08.2022Vydané v 2022 International Conference on Signal and Information Processing (IConSIP) (26.08.2022)“…Time complexity describes the amount of time taken by the computer to run a code by counting the number of operations performed in an algorithm…”
Získať plný text
Konferenčný príspevok.. -
19
Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations
ISSN: 0021-9991, 1090-2716Vydavateľské údaje: Elsevier Inc 15.08.2023Vydané v Journal of computational physics (15.08.2023)“…We construct quantum algorithms to compute the solution and/or physical observables of nonlinear ordinary differential equations (ODEs…”
Získať plný text
Journal Article -
20
Probabilistic Robustness Analysis—Risks, Complexity, and Algorithms
ISSN: 0363-0129, 1095-7138Vydavateľské údaje: Philadelphia Society for Industrial and Applied Mathematics 01.01.2008Vydané v SIAM journal on control and optimization (01.01.2008)“… with essentially any desired accuracy and confidence using algorithms with complexity that is linear in the dimension of the uncertainty space…”
Získať plný text
Journal Article

