Results 41 to 50 of about 7,486,633 (332)
BSA - exact algorithm computing LTS estimate
The main result of this paper is a new exact algorithm computing the estimate given by the Least Trimmed Squares (LTS). The algorithm works under very weak assumptions.
Agulló +13 more
core +1 more source
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem [PDF]
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
Exact and greedy algorithms of allocating experts to maximum set of programmer teams
The allocation of experts to programmer teams, which meet constraints on professional competences related to programming technologies, languages and tools an IT project specifies is a hard combinatorial problem.
A. A. Prihozhy
doaj +1 more source
An exact algorithm for the inventory routing problem with logistic ratio
The Inventory Routing Problem with Logistic Ratio (IRPLR) is a variant of the classical IRP where, instead of the total distribution cost, the ratio between the total distribution cost and the total delivered quantity is minimized, giving rise to a ...
C. Archetti +2 more
semanticscholar +1 more source
Numerical Treatment of Uniformly Convergent Method for Convection Diffusion Problem
In this paper, we will study the convergence properties of the method designed for the convection-diffusion problem. We will prove that the analytical and numerical methods give the same result.
Ali Filiz
doaj +1 more source
An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs
We describe an exact branch-and-bound algorithm for the maximum weight clique problem (MWC), called WLMC, that is especially suited for large vertex-weighted graphs.
Hua Jiang, Chu Min Li, F. Manyà
semanticscholar +1 more source
Iterative compression and exact algorithms
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. The main purpose of this paper is to show that iterative compression can also be used in the design of exact exponential time algorithms. We exemplify our findings with algorithms for the Maximum Independent Set problem, a counting version of k-Hitting Set ...
Fomin, Fedor V. +4 more
openaire +3 more sources
Exact algorithm for the problem of the minimum complete spanning tree of a divisible multiple graph
We study undirected multiple graphs of any natural multiplicity $k > 1$. There are edges of three types: ordinary edges, multiple edges, and multi-edges.
Alexander V. Smirnov
doaj +1 more source
Convergence and coupling for spin glasses and hard spheres [PDF]
We discuss convergence and coupling of Markov chains, and present general relations between the transfer matrices describing these two processes. We then analyze a recently developed local-patch algorithm, which computes rigorous upper bound for the ...
Chanal, Cedric, Krauth, Werner
core +1 more source
About the exact simulation of bivariate (reciprocal) Archimax copulas
We provide an exact simulation algorithm for bivariate Archimax copulas, including instances with negative association. In contrast to existing simulation approaches, the feasibility of our algorithm is directly linked to the availability of an exact ...
Mai Jan-Frederik
doaj +1 more source

