Sciweavers

1279 search results - page 66 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
ATAL
2010
Springer
13 years 10 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
14 years 3 months ago
An approximate dynamic programming approach to probabilistic reachability for stochastic hybrid systems
— This paper addresses the computational overhead involved in probabilistic reachability computations for a general class of controlled stochastic hybrid systems. An approximate ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 9 months ago
Approximate max-integral-flow/min-multicut theorems
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
Kenji Obata
PPSN
2004
Springer
14 years 2 months ago
Constrained Evolutionary Optimization by Approximate Ranking and Surrogate Models
Abstract. The paper describes an evolutionary algorithm for the general nonlinear programming problem using a surrogate model. Surrogate models are used in optimization when model ...
Thomas Philip Runarsson
SODA
2004
ACM
203views Algorithms» more  SODA 2004»
13 years 10 months ago
Approximation schemes for multidimensional packing
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
José R. Correa, Claire Kenyon