We present an any-time concurrent probabilistic temporal planner that includes continuous and discrete uncertainties and metric functions. Our approach is a direct policy search t...
We use prior and boundary estimates as the approximation of outside probability and establish our beam thresholding strategies based on these estimates. Lexical items, e.g. head wo...
Denote by an -component a connected b-uniform hypergraph with k edges and k(b - 1) - vertices. We prove that the expected number of creations of -component during a random hypergr...
This paper discusses five different ways to approximate the loss rate in a fundamental two class priority system, where each class has its own finite capacity buffer, as well as an...
Jeroen Van Velthoven, Benny Van Houdt, Chris Blond...
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....