Sciweavers

10901 search results - page 152 / 2181
» Approximations in Distributed Optimization
Sort
View
AAAI
2006
15 years 7 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
FOCM
2006
65views more  FOCM 2006»
15 years 6 months ago
Approximation Methods for Supervised Learning
Let be an unknown Borel measure defined on the space Z := X
Ronald A. DeVore, Gerard Kerkyacharian, Dominique ...
EOR
2010
87views more  EOR 2010»
15 years 6 months ago
Inventory systems with stochastic demand and supply: Properties and approximations
ic copy available at: http://ssrn.com/abstract=1115410 Inventory Systems with Stochastic Demand and Supply: Properties and Approximations Amanda J. Schmitt Center for Transportatio...
Amanda J. Schmitt, Lawrence V. Snyder, Zuo-Jun Max...
PLDI
2010
ACM
15 years 11 months ago
Smooth interpretation
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
Swarat Chaudhuri, Armando Solar-Lezama
SPAA
2004
ACM
15 years 12 months ago
Balanced graph partitioning
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
Konstantin Andreev, Harald Räcke