Results 21 to 30 of about 892,017 (284)

Exact and Approximation Algorithms for Sensor Placement Against DDoS Attacks

open access: yesInternational 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

Harmonic and Refined Harmonic Shift-Invert Residual Arnoldi and Jacobi--Davidson Methods for Interior Eigenvalue Problems [PDF]

open access: yes, 2015
This paper concerns the harmonic shift-invert residual Arnoldi (HSIRA) and Jacobi--Davidson (HJD) methods as well as their refined variants RHSIRA and RHJD for the interior eigenvalue problem.
Jia, Zhongxiao, Li, Cen
core   +1 more source

Experimental Study of Excessive Local Refinement Reduction Techniques for Global Optimization DIRECT-Type Algorithms

open access: yesMathematics, 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]

open access: yesInternational 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

New algorithms for Exact Satisfiability

open access: yesTheoretical Computer Science, 2003
The Exact Satisfiability problem is to determine if a CNF-formula has a truth assignment satisfying exactly one literal in each clause; Exact 3-Satisfiability is the version in which each clause contains at most three literals. In this paper, we present algorithms for Exact Satisfiability and Exact 3-Satisfiability running in time O(2^{0.2325n}) and O ...
Madsen, Bolette Ammitzbøll   +2 more
openaire   +5 more sources

Similarity Identification Based on Word Trigrams Using Exact String Matching Algorithms

open access: yesIntensif: 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

open access: yesAlgorithms, 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

A Parallel Best-Response Algorithm with Exact Line Search for Nonconvex Sparsity-Regularized Rank Minimization [PDF]

open access: yes, 2017
In this paper, we propose a convergent parallel best-response algorithm with the exact line search for the nondifferentiable nonconvex sparsity-regularized rank minimization problem.
Pesavento, Marius, Yang, Yang
core   +2 more sources

Exact quantum Fourier transforms and discrete logarithm algorithms [PDF]

open access: yes, 2003
We show how the quantum fast Fourier transform (QFFT) can be made exact for arbitrary orders (first for large primes). For most quantum algorithms only the quantum Fourier transform of order $2^n$ is needed, and this can be done exactly.
Mosca, Michele, Zalka, Christof
core   +4 more sources

Special Issue on Exact and Heuristic Scheduling Algorithms

open access: yesAlgorithms, 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

Home - About - Disclaimer - Privacy