Sciweavers

8197 search results - page 315 / 1640
» Adaptive functional programming
Sort
View
UAI
2008
15 years 8 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
ICML
2003
IEEE
16 years 7 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
CAV
2009
Springer
181views Hardware» more  CAV 2009»
16 years 7 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
187
Voted
IJCNN
2007
IEEE
16 years 1 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
ESERNET
2003
Springer
15 years 12 months ago
Functional Testing, Structural Testing, and Code Reading: What Fault Type Do They Each Detect?
The origin of the study described here is the experiment performed by Basili and Selby, further replicated by Kamsties and Lott, and once again by Wood et al. These experiments inv...
Natalia Juristo Juzgado, Sira Vegas