Sciweavers

784 search results - page 18 / 157
» Relaxing the Value Restriction
Sort
View
JIIS
2000
75views more  JIIS 2000»
13 years 9 months ago
A Value-Driven System for Autonomous Information Gathering
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 ...
Joshua Grass, Shlomo Zilberstein
STOC
1999
ACM
125views Algorithms» more  STOC 1999»
14 years 2 months ago
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut
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, ...
ECSQARU
2001
Springer
14 years 2 months ago
Space-Progressive Value Iteration: An Anytime Algorithm for a Class of POMDPs
Abstract. Finding optimal policies for general partially observable Markov decision processes (POMDPs) is computationally difficult primarily due to the need to perform dynamic-pr...
Nevin Lianwen Zhang, Weihong Zhang
ORL
2008
88views more  ORL 2008»
13 years 10 months ago
Approximating integrals of multivariate exponentials: A moment approach
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...
MP
2002
85views more  MP 2002»
13 years 9 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
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...
Dimitris Bertsimas, Jay Sethuraman