Sciweavers

153 search results - page 16 / 31
» Some Decision Problems of Enormous Complexity
Sort
View
PKDD
2009
Springer
153views Data Mining» more  PKDD 2009»
14 years 2 months ago
Subspace Regularization: A New Semi-supervised Learning Method
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...
Yan-Ming Zhang, Xinwen Hou, Shiming Xiang, Cheng-L...
ESAW
2004
Springer
14 years 27 days ago
Techniques for Analysis and Calibration of Multi-agent Simulations
In this paper we present analysis and calibration techniques that exploit knowledge about a multi agent society in order to calibrate the system parameters of a corresponding socie...
Manuel Fehler, Franziska Klügl, Frank Puppe
ATAL
2003
Springer
14 years 22 days ago
Constructing optimal policies for agents with constrained architectures
Optimal behavior is a very desirable property of autonomous agents and, as such, has received much attention over the years. However, making optimal decisions and executing optima...
Dmitri A. Dolgov, Edmund H. Durfee
COR
2008
142views more  COR 2008»
13 years 7 months ago
Application of reinforcement learning to the game of Othello
Operations research and management science are often confronted with sequential decision making problems with large state spaces. Standard methods that are used for solving such c...
Nees Jan van Eck, Michiel C. van Wezel
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 2 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith