Výsledky vyhľadávania - Complexity analysis of algorithms

Upresniť hľadanie
  1. 1

    Regional complexity analysis of algorithms for nonconvex smooth optimization Autor Curtis, Frank E., Robinson, Daniel P.

    ISSN: 0025-5610, 1436-4646
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.05.2021
    Vydané 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. 2

    Regional complexity analysis of algorithms for nonconvex smooth optimization Autor Curtis, Frank E., Robinson, Daniel P.

    ISSN: 0025-5610, 1436-4646
    Vydavateľské údaje: United States Springer 01.04.2020
    Vydané v Mathematical programming (01.04.2020)
    “…Not provided…”
    Získať plný text
    Journal Article
  3. 3

    New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces Autor Romaguera, S., Tirado, P., Valero, O.

    ISSN: 0020-7160, 1029-0265
    Vydavateľské údaje: Abingdon Taylor & Francis 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. 4
  5. 5

    A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms Autor Mohammadi, Zahra, Valero, Oscar

    ISSN: 0166-8641, 1879-3207
    Vydavateľské údaje: Elsevier B.V 15.04.2016
    Vydané 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. 6

    On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms Autor Shahzad, Naseer, Valero, Oscar, Alghamdi, Mohammed A, Alghamdi, Maryam A

    ISSN: 1687-1812, 1687-1812, 2730-5422
    Vydavateľské údaje: Cham Springer International Publishing 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. 7

    Editorial: Surveys in Algorithm Analysis and Complexity Theory, Part II (Special Issue) Autor Jansson, Jesper

    ISSN: 1999-4893, 1999-4893
    Vydavateľské údaje: Basel MDPI AG 01.04.2025
    Vydané 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. 8

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

    ISSN: 0925-5273, 1873-7579
    Vydavateľské údaje: Elsevier B.V 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. 9

    Editorial: Surveys in Algorithm Analysis and Complexity Theory (Special Issue) Autor Jansson, Jesper

    ISSN: 1999-4893, 1999-4893
    Vydavateľské údaje: Basel MDPI AG 30.03.2023
    Vydané 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. 10

    Puiseux series solutions of ODEs Autor Ali Ayad, Ali Fares, Youssef Ayyad, Raafat Tarraf

    ISSN: 1072-6691
    Vydavateľské údaje: Texas State University 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. 11

    Regional Complexity Analysis of Algorithms for Nonconvex Smooth Optimization Autor Curtis, Frank E, Robinson, Daniel P

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 24.08.2018
    Vydané 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. 12

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

    ISSN: 0022-3239, 1573-2878
    Vydavateľské údaje: New York Springer US 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. 13

    3D Urban UAV Relay Placement: Linear Complexity Algorithm and Analysis Autor Chen, Junting, Mitra, Urbashi, Gesbert, David

    ISSN: 1536-1276, 1558-2248
    Vydavateľské údaje: New York IEEE 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. 14

    On aggregation of normed structures Autor Martín, J., Mayor, G., Valero, O.

    ISSN: 0895-7177, 1872-9479
    Vydavateľské údaje: Kidlington Elsevier Ltd 01.07.2011
    Vydané 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. 15

    Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis Autor Jiang, Bo, Lin, Tianyi, Ma, Shiqian, Zhang, Shuzhong

    ISSN: 0926-6003, 1573-2894
    Vydavateľské údaje: New York Springer US 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. 16

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

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Vydavateľské údaje: Kidlington Elsevier Ltd 01.03.2014
    Vydané 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. 17

    Complexity analysis of algorithms in algebraic computation Autor Sharma, Vikram

    ISBN: 9781109858686, 110985868X
    Vydavateľ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. 18

    Big-O Time Complexity Analysis Of Algorithm Autor Phalke, Swapnil, Vaidya, Yogita, Metkar, Shilpa

    Vydavateľské údaje: IEEE 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. 19

    Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations Autor Jin, Shi, Liu, Nana, Yu, Yue

    ISSN: 0021-9991, 1090-2716
    Vydavateľské údaje: Elsevier Inc 15.08.2023
    Vydané 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. 20

    Probabilistic Robustness Analysis—Risks, Complexity, and Algorithms Autor Chen, Xinjia, Zhou, Kemin, Aravena, Jorge

    ISSN: 0363-0129, 1095-7138
    Vydavateľské údaje: Philadelphia Society for Industrial and Applied Mathematics 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