Sciweavers

1176 search results - page 10 / 236
» Sparse reward processes
Sort
View
104
Voted
AIPS
2006
15 years 1 months ago
Probabilistic Planning with Nonlinear Utility Functions
Researchers often express probabilistic planning problems as Markov decision process models and then maximize the expected total reward. However, it is often rational to maximize ...
Yaxin Liu, Sven Koenig
ATAL
2009
Springer
15 years 6 months ago
Reward shaping for valuing communications during multi-agent coordination
Decentralised coordination in multi-agent systems is typically achieved using communication. However, in many cases, communication is expensive to utilise because there is limited...
Simon A. Williamson, Enrico H. Gerding, Nicholas R...
AAAI
2008
15 years 2 months ago
Unknown Rewards in Finite-Horizon Domains
"Human computation" is a recent approach that extracts information from large numbers of Web users. reCAPTCHA is a human computation project that improves the process of...
Colin McMillen, Manuela M. Veloso
SIGGRAPH
2010
ACM
15 years 4 months ago
Learning behavior styles with inverse reinforcement learning
We present a method for inferring the behavior styles of character controllers from a small set of examples. We show that a rich set of behavior variations can be captured by dete...
Seong Jae Lee, Zoran Popovic
FCCM
2005
IEEE
142views VLSI» more  FCCM 2005»
15 years 5 months ago
FPGA-Based Vector Processing for Solving Sparse Sets of Equations
The solution to a set of sparse linear equations Ax = b, where A is an n×n sparse matrix and b is an n-element vector, can be obtained using the W-matrix method. An enhanced vect...
Muhammad Z. Hasan, Sotirios G. Ziavras