Sciweavers

2725 search results - page 533 / 545
» Constraint Solving for Interpolation
Sort
View
NIPS
1998
13 years 11 months ago
Risk Sensitive Reinforcement Learning
In this paper, we consider Markov Decision Processes (MDPs) with error states. Error states are those states entering which is undesirable or dangerous. We define the risk with re...
Ralph Neuneier, Oliver Mihatsch
IJCAI
1997
13 years 11 months ago
Change, Change, Change: Three Approaches
We consider the frame problem, that is, char­ acterizing the assumption that properties tend to persist over time. We show that there are at least three distinct assumptions that...
Tom Costello
COLING
1996
13 years 11 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
AAAI
2008
13 years 11 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 11 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe