Výsledky vyhľadávania - "algorithm analysis and problems complexity"

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

“…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…”
Získať plný text

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

“…Intelligent transportation (e.g., intelligent traffic light) makes our travel more convenient and efficient. With the development of mobile Internet and…”
Získať plný text

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

Získať 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 ) is one of the few examples for which a super-constant…”
Získať plný text

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

“…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…”
Získať plný text

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

“…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…”
Získať plný text

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

“…We study the existence of polynomial kernels, for parameterized problems without a polynomial kernel on general graphs, when restricted to graphs of bounded…”
Získať plný text

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

Získať plný text

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

“…Large language models (LLMs) have shown superior performance in various areas. And LLMs have the potential to revolutionize data management by serving as the…”
Získať plný text

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

“…Constrained clustering problems generalize classical clustering formulations, e.g., k -median , k -means , by imposing additional constraints on the…”
Získať plný text

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

“…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…”
Získať plný text

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

“…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…”
Získať plný text

Correction: Galloping in Fast-Growth Natural Merge Sorts Autor Ghasemi, Elahe, Jugé, Vincent, Khalighinejad, Ghazal, Yazdanyar, Helia

Získať plný text

Representation Learning in Multi-view Clustering: A Literature Review Autor Chen, Man-Sheng, Lin, Jia-Qi, Li, Xiang-Long, Liu, Bao-Yu, Wang, Chang-Dong, Huang, Dong, Lai, Jian-Huang

“…Multi-view clustering (MVC) has attracted more and more attention in the recent few years by making full use of complementary and consensus information between…”
Získať plný text

Dynamic and Internal Longest Common Substring Autor Amir, Amihood, Charalampopoulos, Panagiotis, Pissis, Solon P., Radoszewski, Jakub

“…Given two strings S and T , each of length at most n , the longest common substring (LCS) problem is to find a longest substring common to S and T . This is a…”
Získať plný text

Multiplicative Drift Analysis Autor Doerr, Benjamin, Johannsen, Daniel, Winzen, Carola

“…We introduce multiplicative drift analysis as a suitable way to analyze the runtime of randomized search heuristics such as evolutionary algorithms. Our…”
Získať plný text

Image Preprocessing in Classification and Identification of Diabetic Eye Diseases Autor Sarki, Rubina, Ahmed, Khandakar, Wang, Hua, Zhang, Yanchun, Ma, Jiangang, Wang, Kate

“…Diabetic eye disease (DED) is a cluster of eye problem that affects diabetic patients. Identifying DED is a crucial activity in retinal fundus images because…”
Získať plný text

Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers Autor Akitaya, Hugo A., Arkin, Esther M., Damian, Mirela, Demaine, Erik D., Dujmović, Vida, Flatland, Robin, Korman, Matias, Palop, Belen, Parada, Irene, Renssen, André van, Sacristán, Vera

“…We present the first universal reconfiguration algorithm for transforming a modular robot between any two facet-connected square-grid configurations using…”
Získať plný text

Edge Exploration of Temporal Graphs Autor Bumpus, Benjamin Merlin, Meeks, Kitty

“…We introduce a natural temporal analogue of Eulerian circuits and prove that, in contrast to the static case, it is NP -hard to determine whether a given…”
Získať plný text

Compact Distributed Certification of Planar Graphs Autor Feuilloley, Laurent, Fraigniaud, Pierre, Montealegre, Pedro, Rapaport, Ivan, Rémila, Éric, Todinca, Ioan

“…Naor M., Parter M., Yogev E.: (The power of distributed verifiers in interactive proofs. In: 31st ACM-SIAM symposium on discrete algorithms (SODA), pp…”
Získať plný text