Search Results - "algorithm analysis"

Refine Results
  1. 1

    Search trajectory networks: A tool for analysing and visualising the behaviour of metaheuristics by Ochoa, Gabriela, Malan, Katherine M., Blum, Christian

    ISSN: 1568-4946, 1872-9681
    Published: Elsevier B.V 01.09.2021
    Published in Applied soft computing (01.09.2021)
    “…A large number of metaheuristics inspired by natural and social phenomena have been proposed in the last few decades, each trying to be more powerful and…”
    Get full text
    Journal Article
  2. 2

    Image Fusion Algorithm Analysis of Digital Media Technology Based on LDA Model by Chi, Jing, Zhu, Congcong, Chen, Boyu

    ISSN: 1877-0509, 1877-0509
    Published: Elsevier B.V 2025
    Published in Procedia computer science (2025)
    “…Digital media technology is playing an increasingly important role in social development, not only as a tool for information dissemination, but also as an…”
    Get full text
    Journal Article
  3. 3

    Normalizing toxicity: the role of recommender algorithms for young people’s mental health and social wellbeing by Regehr, Kaitlyn, Shaughnessy, Caitlin, Zhao, Minzhu, Cambazoglu, Idil, Turner, Alfie, Shaughnessy, Nicola

    ISSN: 1664-1078, 1664-1078
    Published: Switzerland Frontiers Media S.A 2025
    Published in Frontiers in psychology (2025)
    “…This article explores how social media recommendation systems shape the digital consumption practices of young people and the potential implications for mental…”
    Get full text
    Journal Article
  4. 4

    Analysis based on statistical distributions: A practical approach for stochastic solvers using discrete and continuous problems by Herzog, Jana, Brest, Janez, Bošković, Borko

    ISSN: 0020-0255, 1872-6291
    Published: Elsevier Inc 01.07.2023
    Published in Information sciences (01.07.2023)
    “…This paper proposes an approach for the analysis and comparison of stochastic solvers based on the statistical distribution of their variables. The observed…”
    Get full text
    Journal Article
  5. 5

    Finding Temporal Paths Under Waiting Time Constraints by Casteigts, Arnaud, Himmel, Anne-Sophie, Molter, Hendrik, Zschoche, Philipp

    ISSN: 0178-4617, 1432-0541
    Published: New York Springer US 01.09.2021
    Published in Algorithmica (01.09.2021)
    “…Computing a (short) path between two vertices is one of the most fundamental primitives in graph algorithmics. In recent years, the study of paths in temporal…”
    Get full text
    Journal Article
  6. 6

    An adaptive helper and equivalent objective evolution strategy for constrained optimization by Xu, Tao, Chen, Hongyang, He, Jun

    ISSN: 0020-0255
    Published: Elsevier Inc 01.02.2025
    Published in Information sciences (01.02.2025)
    “…The matrix adaptation evolution strategy is a simplified covariance matrix adaptation evolution strategy with reduced computational cost. Using it as a search…”
    Get full text
    Journal Article
  7. 7

    A Survey of Traffic Prediction: from Spatio-Temporal Data to Intelligent Transportation by Yuan, Haitao, Li, Guoliang

    ISSN: 2364-1185, 2364-1541
    Published: Singapore Springer Singapore 01.03.2021
    Published in Data Science and Engineering (01.03.2021)
    “…Intelligent transportation (e.g., intelligent traffic light) makes our travel more convenient and efficient. With the development of mobile Internet and…”
    Get full text
    Journal Article
  8. 8

    A Short Note on Computing Permutations by Gburzynski, Pawel, Zalewski, Janusz

    ISSN: 2300-5963
    Published: Polish Information Processing Society 2023
    “…We discuss an algorithm for generating all permutations of numbers between 1 and N. The algorithm is short and efficient, yet its behavior is not obvious from…”
    Get full text
    Conference Proceeding Journal Article
  9. 9

    Correction: Robust dequantization of the quantum singular value transformation and quantum machine learning algorithms by Le Gall, François

    ISSN: 1016-3328, 1420-8954
    Published: Cham Springer International Publishing 01.06.2025
    Published in Computational complexity (01.06.2025)
    Get full text
    Journal Article
  10. 10

    Extremal behavior of the Greedy algorithm for a triangle scheduling problem by Balogh, János, Békési, József, Büki, Nóra, Dósa, György, Tuza, Zsolt

    ISSN: 0305-0548, 1873-765X
    Published: Elsevier Ltd 01.09.2024
    Published in Computers & operations research (01.09.2024)
    “…We study the mixed-criticality scheduling problem, where the goal is to schedule jobs with different criticality levels on a single machine. As shown by Dürr…”
    Get full text
    Journal Article
  11. 11

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

    ISSN: 0178-4617, 1432-0541
    Published: New York Springer US 01.05.2018
    Published in Algorithmica (01.05.2018)
    “…The ( 1 + ( λ , λ ) )  genetic algorithm proposed in Doerr et al. (Theor Comput Sci 567:87–104, 2015 ) is one of the few examples for which a super-constant…”
    Get full text
    Journal Article
  12. 12

    Temporal Network Optimization Subject to Connectivity Constraints by Mertzios, George B., Michail, Othon, Spirakis, Paul G.

    ISSN: 0178-4617, 1432-0541
    Published: New York Springer US 01.04.2019
    Published in Algorithmica (01.04.2019)
    “…In this work we consider temporal networks , i.e. networks defined by a labeling λ assigning to each edge of an underlying graph G a set of discrete…”
    Get full text
    Journal Article
  13. 13

    Automating approximation analysis for Nash equilibria algorithms in two-player games by Deng, Xiaotie, Li, Dongchen, Li, Hanyu

    ISSN: 0890-5401
    Published: Elsevier Inc 01.11.2025
    Published in Information and computation (01.11.2025)
    “…Computing polynomial-time approximate Nash equilibria (NE) is a fundamental problem in algorithmic game theory, with deep connections to the complexity class…”
    Get full text
    Journal Article
  14. 14

    The Runtime of the Compact Genetic Algorithm on Jump Functions by Doerr, Benjamin

    ISSN: 0178-4617, 1432-0541
    Published: New York Springer US 01.10.2021
    Published in Algorithmica (01.10.2021)
    “…In the first and so far only mathematical runtime analysis of an estimation-of-distribution algorithm (EDA) on a multimodal problem, Hasenöhrl and Sutton…”
    Get full text
    Journal Article
  15. 15

    Twin-width and Polynomial Kernels by Bonnet, Édouard, Kim, Eun Jung, Reinald, Amadeus, Thomassé, Stéphan, Watrigant, Rémi

    ISSN: 0178-4617, 1432-0541
    Published: New York Springer US 01.11.2022
    Published in Algorithmica (01.11.2022)
    “…We study the existence of polynomial kernels, for parameterized problems without a polynomial kernel on general graphs, when restricted to graphs of bounded…”
    Get full text
    Journal Article
  16. 16

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

    ISSN: 0178-4617, 1432-0541
    Published: New York Springer US 01.10.2025
    Published in Algorithmica (01.10.2025)
    Get full text
    Journal Article
  17. 17

    DB-GPT: Large Language Model Meets Database by Zhou, Xuanhe, Sun, Zhaoyan, Li, Guoliang

    ISSN: 2364-1185, 2364-1541
    Published: Singapore Springer Nature Singapore 01.03.2024
    Published in Data Science and Engineering (01.03.2024)
    “…Large language models (LLMs) have shown superior performance in various areas. And LLMs have the potential to revolutionize data management by serving as the…”
    Get full text
    Journal Article
  18. 18

    Clustering What Matters in Constrained Settings: Improved Outlier to Outlier-Free Reductions by Jaiswal, Ragesh, Kumar, Amit

    ISSN: 0178-4617, 1432-0541
    Published: New York Springer US 01.08.2025
    Published in Algorithmica (01.08.2025)
    “…Constrained clustering problems generalize classical clustering formulations, e.g., k -median , k -means , by imposing additional constraints on the…”
    Get full text
    Journal Article
  19. 19

    On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem by Ganian, Robert, Klute, Fabian, Ordyniak, Sebastian

    ISSN: 0178-4617, 1432-0541
    Published: New York Springer US 01.01.2021
    Published in Algorithmica (01.01.2021)
    “…We study the parameterized complexity of the Bounded-Degree Vertex Deletion problem (BDD), where the aim is to find a maximum induced subgraph whose maximum…”
    Get full text
    Journal Article
  20. 20

    Fast Mutation in Crossover-Based Algorithms by Antipov, Denis, Buzdalov, Maxim, Doerr, Benjamin

    ISSN: 0178-4617, 1432-0541
    Published: New York Springer US 01.06.2022
    Published in Algorithmica (01.06.2022)
    “…The heavy-tailed mutation operator proposed in Doerr et al. (GECCO 2017), called fast mutation to agree with the previously used language, so far was proven to…”
    Get full text
    Journal Article