Results 31 to 40 of about 2,298,639 (295)
Exact and Approximation Algorithms for Sensor Placement Against DDoS Attacks
International Journal of Applied Mathematics and Computer Science, 2022 In a distributed denial of service (DDoS) attack, the attacker gains control of many network users through a virus. Then the controlled users send many requests to a victim, leading to its resources being depleted. DDoS attacks are hard to defend because
Junosza-Szaniawski Konstanty +2 more
doaj +1 more source
Exact Exponential Algorithms for Clustering Problems [PDF]
, 2022 In this paper we initiate a systematic study of exact algorithms for some of the well known clustering problems, namely k-MEDIAN and k-MEANS. In k-MEDIAN, the input consists of a set X of n points belonging to a metric space, and the task is to select a ...
Fomin, Fedor +7 more
core +1 more source
Mathematics, 2022 This article considers a box-constrained global optimization problem for Lipschitz continuous functions with an unknown Lipschitz constant. The well-known derivative-free global search algorithm DIRECT (DIvide RECTangle) is a promising approach for such ...
Linas Stripinis, Remigijus Paulavičius
doaj +1 more source
Using a new algorithm to improve the search answer in quadratic assignment problem (QAP) [PDF]
International Journal of Research in Industrial Engineering, 2021 Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems ...
Hossein Jafari, Abbas Sheykhan
doaj +1 more source
Exact Algorithms for Biclique Coloring
Matemática Contemporânea, 2022 Summary: A \(k\)-biclique-coloring of \(G\) is \(k\)-coloring of the vertices of \(G\) with no maximal monochromatic biclique. A recent work showed that determining if such a coloring exists is \(\Sigma_2^{\mathsf{P}}\)-complete for \(k>2\). We present algorithms to determine if a graph has a \(k\)-biclique-coloring: an \(\mathcal{O}^\ast(4^n)\)-time ...
Guilherme Gomes +2 more
openaire +2 more sources
The Min-Max Edge q-Coloring Problem
Journal of Graph Algorithms and Applications, 2015 In this paper we introduce and study a new problem named min-max edge q-coloring which is motivated by applications in wireless mesh networks. The input of the problem consists of an undirected graph and an integer q.
Tommi Larjomaa, Alexandru Popa
doaj +1 more source
Similarity Identification Based on Word Trigrams Using Exact String Matching Algorithms
Intensif: Jurnal Ilmiah Penelitian Teknologi dan Penerapan Sistem Informasi, 2022 Several studies regarding excellent exact string matching algorithms can be used to identify similarity, including the Rabin-Karp, Winnowing, and Horspool Boyer-Moore algorithms.
Abdul Fadlil +2 more
doaj +1 more source
Optimal Clustering in Stable Instances Using Combinations of Exact and Noisy Ordinal Queries
Algorithms, 2021 This work studies clustering algorithms which operates with ordinal or comparison-based queries (operations), a situation that arises in many active-learning applications where “dissimilarities” between data points are evaluated by humans.
Enrico Bianchi, Paolo Penna
doaj +1 more source
Special Issue on Exact and Heuristic Scheduling Algorithms
Algorithms, 2019 This special issue of Algorithms is a follow-up issue of an earlier one, entitled ‘Algorithms for Scheduling Problems’. In particular, the new issue is devoted to the development of exact and heuristic scheduling algorithms.
Frank Werner +2 more
doaj +1 more source
Exact and Approximation Algorithms for the Multi-Depot Capacitated Arc Routing Problems
Tsinghua Science and Technology, 2023 In this work, we investigate a generalization of the classical capacitated arc routing problem, called the Multi-depot Capacitated Arc Routing Problem (MCARP). We give exact and approximation algorithms for different variants of the MCARP.
Wei Yu, Yujie Liao, Yichen Yang
doaj +1 more source