Sciweavers

1547 search results - page 129 / 310
» Randomized Variable Elimination
Sort
View
UAI
1998
15 years 4 months ago
Structured Reachability Analysis for Markov Decision Processes
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...
Craig Boutilier, Ronen I. Brafman, Christopher W. ...
135
Voted
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 3 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur
JANCL
2008
170views more  JANCL 2008»
15 years 3 months ago
Algorithmic correspondence and completeness in modal logic
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
Willem Conradie, Valentin Goranko
JAR
2008
107views more  JAR 2008»
15 years 3 months ago
Differential Dynamic Logic for Hybrid Systems
Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equat...
André Platzer
150
Voted
ACL
2011
14 years 7 months ago
Joint Training of Dependency Parsing Filters through Latent Support Vector Machines
Graph-based dependency parsing can be sped up significantly if implausible arcs are eliminated from the search-space before parsing begins. State-of-the-art methods for arc filt...
Colin Cherry, Shane Bergsma