Sciweavers

580 search results - page 30 / 116
» Approximation Algorithms for Temporal Reasoning
Sort
View
ML
2000
ACM
126views Machine Learning» more  ML 2000»
15 years 2 months ago
Learning to Play Chess Using Temporal Differences
In this paper we present TDLEAF( ), a variation on the TD( ) algorithm that enables it to be used in conjunction with game-tree search. We present some experiments in which our che...
Jonathan Baxter, Andrew Tridgell, Lex Weaver
115
Voted
JMLR
2010
129views more  JMLR 2010»
14 years 9 months ago
Approximation of hidden Markov models by mixtures of experts with application to particle filtering
Selecting conveniently the proposal kernel and the adjustment multiplier weights of the auxiliary particle filter may increase significantly the accuracy and computational efficie...
Jimmy Olsson, Jonas Ströjby
133
Voted
ECRTS
2010
IEEE
15 years 2 months ago
The Demand Bound Function Interface of Distributed Sporadic Pipelines of Tasks Scheduled by EDF
—In distributed real-time embedded systems (DRE), it is common to model an application as a set of task chains. Each chain is activated cyclically and must complete before an end...
Nicola Serreli, Giuseppe Lipari, Enrico Bini
IJCAI
1997
15 years 3 months ago
Exploiting Domain Knowledge for Approximate Diagnosis
The AI literature contains many definitions of diagnostic reasoning most of which are defined in terms of the logical entailment relation. We use existing work on approximate en...
Annette ten Teije, Frank van Harmelen
166
Voted
FGR
2011
IEEE
247views Biometrics» more  FGR 2011»
14 years 5 months ago
Segment and recognize expression phase by fusion of motion area and neutral divergence features
—An expression can be approximated by a sequence of temporal segments called neutral, onset, offset and apex. However, it is not easy to accurately detect such temporal segments ...
Shizhi Chen, YingLi Tian, Qingshan Liu, Dimitris N...