Exact algorithm

In computer science and operations research, exact algorithms are algorithms that always solve an optimization problem to optimality. Unless P = NP…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

We consider the problem of motion planning in the presence of uncertain obstacles, modeled as polytopes with Gaussian-distributed…

2017

Gaussian scale mixture priors are frequently employed in Bayesian analysis of high-dimensional models, and a theoretical…

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

We explore the multicast lifetime capacity of energy-limited wireless ad hoc networks using directional multibeam antennas by…

2008

We present a general metaheuristic for joint chance-constrained stochastic programs with discretely distributed parameters. We…

2005

2004

The paper deals with the interval data discrete optimization problems. In order to calculate the optimal solution the maximal…

2004

In this paper, we propose an optimal algorithm for the Multiple-choice Multidimensional Knapsack Problem MMKP. The main principle…

1998

This paper presents a class of approximate inference algorithms, based on bucket elimination 14], that trade accuracy for…

1996

Computing the schedule on a configurable parallel system adds one dimension to the traditional scheduling problem. Besides…