Results 21 to 30 of about 1,237,463 (291)
An Exact Algorithm for Minimum Vertex Cover Problem
Mathematics, 2019 In this paper, we propose a branch-and-bound algorithm to solve exactly the minimum vertex cover (MVC) problem. Since a tight lower bound for MVC has a significant influence on the efficiency of a branch-and-bound algorithm, we define two novel lower ...
Luzhi Wang +3 more
doaj +1 more source
New algorithms for Exact Satisfiability
Theoretical 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
QuateXelero: an accelerated exact network motif detection algorithm. [PDF]
PLoS ONE, 2013 Finding motifs in biological, social, technological, and other types of networks has become a widespread method to gain more knowledge about these networks' structure and function.
Sahand Khakabimamaghani +4 more
doaj +1 more source
Independent Exact Permutation Testing Algorithm for Distinguishing Sequential Pattern Discovery [PDF]
Jisuanji gongcheng, 2021 Traditional distinguishing sequential pattern mining algorithms usually generate a number of false positive patterns in their results, which hinder the subsequent decisions of tasks.
WU Jun, OUYANG Aijia, ZHANG Lin
doaj +1 more source
Exact quantum Fourier transforms and discrete logarithm algorithms [PDF]
, 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
Polynomial-time Computation of Exact Correlated Equilibrium in Compact Games [PDF]
, 2010 In a landmark paper, Papadimitriou and Roughgarden described a polynomial-time algorithm ("Ellipsoid Against Hope") for computing sample correlated equilibria of concisely-represented games.
Jiang, Albert Xin, Leyton-Brown, Kevin
core +3 more sources
A Short Path Quantum Algorithm for Exact Optimization [PDF]
Quantum, 2018 We give a quantum algorithm to exactly solve certain problems in combinatorial optimization, including weighted MAX-2-SAT as well as problems where the objective function is a weighted sum of products of Ising variables, all terms of the same degree $D$;
M. B. Hastings
doaj +1 more source
Exact and kernelization algorithms for Closet String
Selecciones Matemáticas, 2020 In this paper we address CLOSEST STRING problem that arises in web searching, coding theory and computational molecular biology. To solve it is to find a string that minimizes the maximum Hamming distance from a given set of strings. CLOSEST STRING is an
Omar Latorre Vilca
doaj +1 more source
Applied Sciences, 2022 In order to solve the problems of low accuracy and low efficiency of point cloud registration for stereo camera systems, we propose a binocular stereo camera point cloud registration method based on IWOA and Improved ICP.
Guanglei Li +3 more
doaj +1 more source
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem [PDF]
, 1997 We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the worst case.
Brassard, Gilles, Hoyer, Peter
core +4 more sources