Sciweavers

502 search results - page 36 / 101
» Monotone Approximation of Decision Problems
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
14 years 7 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
TRANSCI
2002
106views more  TRANSCI 2002»
14 years 9 months ago
The Stochastic Inventory Routing Problem with Direct Deliveries
Vendor managed inventory replenishment is a business practice in which vendors monitor their customers' inventories, and decide when and how much inventory should be replenis...
Anton J. Kleywegt, Vijay S. Nori, Martin W. P. Sav...
EOR
2006
78views more  EOR 2006»
14 years 9 months ago
A multi-objective resource allocation problem in PERT networks
We develop a multi-objective model for resource allocation problem in PERT networks with exponentially or Erlang distributed activity durations, where the mean duration of each ac...
Amir Azaron, Hideki Katagiri, Masatoshi Sakawa, Ko...
IPCO
2008
114views Optimization» more  IPCO 2008»
14 years 11 months ago
The Stochastic Machine Replenishment Problem
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
Kamesh Munagala, Peng Shi
ENTCS
2006
123views more  ENTCS 2006»
14 years 9 months ago
Nonmonotonic Trust Management for P2P Applications
Community decisions about access control in virtual communities are non-monotonic in nature. This means that they cannot be expressed in current, monotonic trust management langua...
Marcin Czenko, Ha Tran, Jeroen Doumen, Sandro Etal...