282 search results - page 9 / 57 » Probabilistic Timed Behavior Trees |
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
EDM
2008
13 years 9 months ago
2008
We present text replays, a method for generating labels that can be used to train classifiers of student behavior. We use this method to label data as to whether students are gamin...
CONCUR
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. In this paper, we introduce weak bisimulation in the framework of Labeled Concurrent Markov Chains, that is, probabilistic transition systems which exhibit both probabili...
COMGEO
2004
ACM
13 years 7 months ago
2004
ACM
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
ICLP
2010
Springer
13 years 11 months ago
2010
Springer
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...