Sciweavers

495 search results - page 40 / 99
» Sparse representation algorithms based on mean-field approxi...
Sort
View
ICML
2002
IEEE
16 years 5 months ago
Algorithm-Directed Exploration for Model-Based Reinforcement Learning in Factored MDPs
One of the central challenges in reinforcement learning is to balance the exploration/exploitation tradeoff while scaling up to large problems. Although model-based reinforcement ...
Carlos Guestrin, Relu Patrascu, Dale Schuurmans
AI
2011
Springer
14 years 11 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
16 years 4 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
IDA
2002
Springer
15 years 4 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
DAC
1996
ACM
15 years 8 months ago
Efficient Full-Wave Electromagnetic Analysis via Model-Order Reduction of Fast Integral Transforms
Abstract-An efficient full-wave electromagnetic analysis tool would be useful in many aspects of engineering design. Development of integral-equation based tools has been hampered ...
Joel R. Philips, Eli Chiprout, David D. Ling