This paper presents a system for autonomous information gathering in an information rich domain under time and monetary resource restrictions. The system gathers information using ...
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...
David R. Karger, Philip N. Klein, Clifford Stein, ...
Abstract. Finding optimal policies for general partially observable Markov decision processes (POMDPs) is computationally difficult primarily due to the need to perform dynamic-pr...
We propose a method to calculate lower and upper bounds of some exponential multivariate integrals using moment relaxations and show that they asymptotically converge to the value...
Dimitris Bertsimas, Xuan Vinh Doan, Jean B. Lasser...
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...