Results 31 to 40 of about 7,486,633 (332)
Computers & Operations Research, 2019 Parallel machine scheduling problems have many practical and industrial applications. In this paper we study a generalization which is the unrelated parallel machine scheduling problem with machine and job sequence setup times (UPMS) with makespan ...
Luis Fanjul-Peyro +2 more
semanticscholar +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
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
Event-Driven Monte Carlo: exact dynamics at all time-scales for discrete-variable models [PDF]
, 2016 We present an algorithm for the simulation of the exact real-time dynamics of classical many-body systems with discrete energy levels. In the same spirit of kinetic Monte Carlo methods, a stochastic solution of the master equation is found, with no need ...
Díaz-Méndez, Rogelio +2 more
core +2 more sources
A new exact algorithm for the Weapon-Target Assignment problem
, 2019 The Weapon-Target Assignment (WTA) problem is of military importance; it computes an optimal assignment of m weapons to n targets such that the expected total damage of the targets is maximized (or equivalently, the expected total survival possibility of
Yiping Lu, D. Chen
semanticscholar +1 more source
Improving Algorithms to Compute All Elements of the Lattice Quark Propagator [PDF]
, 2004 We present a new exact algorithm for estimating all elements of the quark propagator. The advantage of the method is that the exact all-to-all propagator is reproduced in a large but finite number of inversions. The efficacy of the algorithm is tested in
Cais, Alan O +4 more
core +4 more sources
On Exact Algorithms for Treewidth
ACM Transactions on Algorithms, 2006 We give experimental and theoretical results on the problem of computing the treewidth of a graph by exact exponential-time algorithms using exponential space or using only polynomial space. We first report on an implementation of a dynamic programming algorithm for computing the treewidth of a graph with running time O
Bodlaender, Hans L. +4 more
openaire +5 more sources
Exact algorithms for the rectilinear block packing problem
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2018 The rectilinear block packing problem is a problem of packing a set of rectilinear blocks into a larger rectangular container with fixed width and unrestricted height. A rectilinear block is a polygonal block whose interior angles are either 90◦ or 270◦.
Ken MATSUSHITA +4 more
doaj +1 more source
Approximate cycles count in undirected graphs [PDF]
International Journal of Computational Intelligence Systems, 2014 In social networks, counting the number of different cycle sizes can be used to measure the entropy of the network that represents its robustness. The exact algorithms to compute cycles in a graph can generate exact results but they are not guaranteed to
Maytham Safar +5 more
doaj +1 more source