Sciweavers

198 search results - page 15 / 40
» Infinite mixtures of trees
Sort
View
SLOGICA
2008
126views more  SLOGICA 2008»
13 years 8 months ago
On the Proof Theory of the Modal mu-Calculus
We study the proof-theoretic relationship between two deductive systems for the modal mu-calculus. First we recall an infinitary system which contains an omega rule allowing to de...
Thomas Studer
CALCO
2007
Springer
129views Mathematics» more  CALCO 2007»
14 years 22 days ago
CIRC : A Circular Coinductive Prover
Abstract. CIRC is an automated circular coinductive prover implemented as an extension of Maude. The circular coinductive technique that forms the core of CIRC is discussed, togeth...
Dorel Lucanu, Grigore Rosu
ICML
2010
IEEE
13 years 9 months ago
Distance dependent Chinese restaurant processes
We develop the distance dependent Chinese restaurant process (CRP), a flexible class of distributions over partitions that allows for nonexchangeability. This class can be used to...
David M. Blei, Peter Frazier
ICAART
2010
INSTICC
14 years 5 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
CADE
2008
Springer
14 years 9 months ago
Certifying a Tree Automata Completion Checker
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
Benoît Boyer, Thomas Genet, Thomas P. Jensen