Results 31 to 40 of about 892,017 (284)
Exact and Heuristic Algorithms for Thrift Cyclic Scheduling
Algorithms, 2009 Non-preemptive schedulers, despite their many discussed drawbacks, remain a very popular choice for practitioners of real-time and embedded systems. The non-preemptive ‘thrift’ cyclic scheduler—variations of which can be found in other application areas ...
Michael J. Short
doaj +1 more source
On the Computation of the Kullback-Leibler Measure for Spectral Distances [PDF]
, 2003 Efficient algorithms for the exact and approximate computation of the symmetrical Kullback-Leibler (1998) measure for spectral distances are presented for linear predictive coding (LPC) spectra.
Klabbers, E., Veldhuis, R.N.J.
core +3 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
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
Improved Distributed Algorithms for Exact Shortest Paths
, 2018 Computing shortest paths is one of the central problems in the theory of distributed computing. For the last few years, substantial progress has been made on the approximate single source shortest paths problem, culminating in an algorithm of Becker et ...
A +3 more
core +1 more source
Exact and Heuristic Multi-Robot Dubins Coverage Path Planning for Known Environments
Sensors, 2023 Coverage path planning (CPP) of multiple Dubins robots has been extensively applied in aerial monitoring, marine exploration, and search and rescue. Existing multi-robot coverage path planning (MCPP) research use exact or heuristic algorithms to address ...
Lin Li +6 more
doaj +1 more source
Stochastic Representations of Ion Channel Kinetics and Exact Stochastic Simulation of Neuronal Dynamics [PDF]
, 2014 In this paper we provide two representations for stochastic ion channel kinetics, and compare the performance of exact simulation with a commonly used numerical approximation strategy.
Anderson, David F. +2 more
core +3 more sources
Improved quantum algorithms for the ordered search problem via semidefinite programming [PDF]
, 2006 One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log_2 N queries to the list, a quantum computer can solve the problem using a ...
Andrew J. Landahl +8 more
core +2 more sources
Iterative compression and exact algorithms
Theoretical Computer Science, 2008 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
Odd-flavor Hybrid Monte Carlo Algorithm for Lattice QCD [PDF]
, 2001 We discuss hybrid Monte Carlo algorithms for odd-flavor lattice QCD simulations. The algorithms include a polynomial approximation which enables us to simulate odd-flavor QCD in the framework of the hybrid Monte Carlo algorithm.
de Forcrand, Philippe, Takaishi, Tetsuya
core +2 more sources