Sciweavers

4716 search results - page 178 / 944
» Tangible functional programming
Sort
View
UAI
2008
15 years 3 months ago
Partitioned Linear Programming Approximations for MDPs
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
Branislav Kveton, Milos Hauskrecht
116
Voted
ICML
2003
IEEE
16 years 3 months ago
Planning in the Presence of Cost Functions Controlled by an Adversary
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
H. Brendan McMahan, Geoffrey J. Gordon, Avrim Blum
101
Voted
CAV
2009
Springer
181views Hardware» more  CAV 2009»
16 years 3 months ago
Size-Change Termination, Monotonicity Constraints and Ranking Functions
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
Amir M. Ben-Amram
ETFA
2008
IEEE
15 years 9 months ago
Evaluation of Sequential Function Charts execution techniques. The Active Steps Algorithm
Programmable Logic Controllers (PLCs) play a significant role in the control of production systems and Sequential Function Chart (SFC) is one of the main programming languages. Th...
Ramon Piedrafita Moreno, José Luis Villarro...
IJCNN
2007
IEEE
15 years 8 months ago
Probability Density Function Estimation Using Orthogonal Forward Regression
— Using the classical Parzen window estimate as the target function, the kernel density estimation is formulated as a regression problem and the orthogonal forward regression tec...
Sheng Chen, Xia Hong, Chris J. Harris