Sciweavers

1279 search results - page 188 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
ATAL
2010
Springer
13 years 10 months ago
Point-based policy generation for decentralized POMDPs
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen
JAIR
2010
115views more  JAIR 2010»
13 years 7 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech
PODS
2011
ACM
163views Database» more  PODS 2011»
12 years 11 months ago
Provenance views for module privacy
Scientific workflow systems increasingly store provenance information about the module executions used to produce a data item, as well as the parameter settings and intermediate...
Susan B. Davidson, Sanjeev Khanna, Tova Milo, Debm...
SIAMSC
2008
123views more  SIAMSC 2008»
13 years 8 months ago
Balanced Incomplete Factorization
In this paper we present a new incomplete factorization of a square matrix into triangular factors in which we get standard LU or LDLT factors (direct factors) and their inverses (...
Rafael Bru, José Marín, José ...
ICALP
2003
Springer
14 years 2 months ago
Multicommodity Demand Flow in a Tree
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepher...