Sciweavers

1684 search results - page 34 / 337
» The lexicographic decision function
Sort
View
ICML
2006
IEEE
14 years 4 months ago
Automatic basis function construction for approximate dynamic programming and reinforcement learning
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
Philipp W. Keller, Shie Mannor, Doina Precup
CORR
2008
Springer
64views Education» more  CORR 2008»
13 years 11 months ago
Implementing general belief function framework with a practical codification for low complexity
In this chapter, we propose a new practical codification of the elements of the Venn diagram in order to easily manipulate the focal elements. In order to reduce the complexity, t...
Arnaud Martin
INFOCOM
2012
IEEE
12 years 1 months ago
Delay optimal multichannel opportunistic access
Abstract—The problem of minimizing queueing delay of opportunistic access of multiple continuous time Markov channels is considered. A new access policy based on myopic sensing a...
Shiyao Chen, Lang Tong, Qing Zhao
ROBOCUP
2007
Springer
105views Robotics» more  ROBOCUP 2007»
14 years 5 months ago
Probabilistic Decision Making in Robot Soccer
Decision making is an important issue in robot soccer, which has not been investigated deeply enough by the RoboCup research community. This paper proposes a probabilistic approach...
Pablo Guerrero, Javier Ruiz-del-Solar, Gonzalo D&i...
CCL
1994
Springer
14 years 3 months ago
Ordered Binary Decision Diagrams and the Davis-Putnam Procedure
Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicat...
Tomás E. Uribe, Mark E. Stickel