Results 31 to 40 of about 2,709,850 (294)

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   +6 more sources

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

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

Exact algorithms for the clustered vehicle routing problem [PDF]

open access: yes, 2014
This study presents new exact algorithms for the Clustered Vehicle Routing Problem (CluVRP). The CluVRP is a generalization of the Capacitated Vehicle Routing Problem (CVRP), in which the customers are grouped into clusters.
Vigo, Daniele   +9 more
core   +1 more source

The Min-Max Edge q-Coloring Problem

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

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

07211 Abstracts Collection – Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes [PDF]

open access: yes, 2007
From May 20 to May 25, 2007, the Dagstuhl Seminar 07211 ``Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
Spinrad, Jeremy P.   +3 more
core   +1 more source

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

Minimizing the Height of Simple Tangles

open access: yesJournal of Graph Algorithms and Applications
A tangle $T$ of height $h$ describes the ordering of $n$ elements called wires on each of $h$ levels. A pair of wires $ab$ is called a swap. Between any two adjacent levels only the ordering of adjacent wires may swap and each wire may participate in ...
Jakob Baumann, Ignaz Rutter
doaj   +1 more source

Exact and Approximation Algorithms for the Multi-Depot Capacitated Arc Routing Problems

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

Home - About - Disclaimer - Privacy