Results 31 to 40 of about 1,237,463 (291)
An ETH-Tight Exact Algorithm for Euclidean TSP [PDF]
, 2018 We study exact algorithms for {\sc Euclidean TSP} in $\mathbb{R}^d$. In the early 1990s algorithms with $n^{O(\sqrt{n})}$ running time were presented for the planar case, and some years later an algorithm with $n^{O(n^{1-1/d})}$ running time was ...
Bodlaender, Hans L. +4 more
core +3 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
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
Multireference Correlation in Long Molecules with the Quadratic Scaling Density Matrix Renormalization Group [PDF]
, 2006 We have devised and implemented a local ab initio Density Matrix Renormalization Group (DMRG) algorithm to describe multireference nondynamic correlations in large systems.
Garnet Kin-Lic Chan +3 more
core +2 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 and greedy algorithms of allocating experts to maximum set of programmer teams
Системный анализ и прикладная информатика, 2022 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
BSA - exact algorithm computing LTS estimate
, 2010 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
Numerical Treatment of Uniformly Convergent Method for Convection Diffusion Problem
Journal of New Theory, 2022 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
A Divide-and-Conquer Algorithm for Betweenness Centrality [PDF]
, 2015 The problem of efficiently computing the betweenness centrality of nodes has been researched extensively. To date, the best known exact and centralized algorithm for this task is an algorithm proposed in 2001 by Brandes.
Bestavros, Azer +3 more
core +1 more source