Skip to search formSkip to main contentSkip to account menu

Exact algorithm

In computer science and operations research, exact algorithms are algorithms that always solve an optimization problem to optimality. Unless P = NP… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We consider the problem of motion planning in the presence of uncertain obstacles, modeled as polytopes with Gaussian-distributed… 
2017
2017
Gaussian scale mixture priors are frequently employed in Bayesian analysis of high-dimensional models, and a theoretical… 
2014
2014
In order to improve energy efficiency in the process of gathering data and transmitting information, compressed sensing (CS) has… 
2012
2012
— Searching a pattern in biological sequence is as good as finding a genetic code in a sequence of DNA. As every day the new gene… 
2009
2009
We explore the multicast lifetime capacity of energy-limited wireless ad hoc networks using directional multibeam antennas by… 
2008
2008
We present a general metaheuristic for joint chance-constrained stochastic programs with discretely distributed parameters. We… 
2004
2004
The paper deals with the interval data discrete optimization problems. In order to calculate the optimal solution the maximal… 
2004
2004
In this paper, we propose an optimal algorithm for the Multiple-choice Multidimensional Knapsack Problem MMKP. The main principle… 
1996
1996
Computing the schedule on a configurable parallel system adds one dimension to the traditional scheduling problem. Besides…