Sciweavers

128 search results - page 14 / 26
» Tractable Cover Compilations
Sort
View
110
Voted
UAI
2008
15 years 1 months ago
Learning Arithmetic Circuits
Graphical models are usually learned without regard to the cost of doing inference with them. As a result, even if a good model is learned, it may perform poorly at prediction, be...
Daniel Lowd, Pedro Domingos
JSAT
2006
126views more  JSAT 2006»
15 years 12 days ago
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
Sylvie Coste-Marquis, Daniel Le Berre, Florian Let...
126
Voted
JAIR
2010
130views more  JAIR 2010»
14 years 7 months ago
Interactive Cost Configuration Over Decision Diagrams
In many AI domains such as product configuration, a user should interactively specify a solution that must satisfy a set of constraints. In such scenarios, offline compilation of ...
Henrik Reif Andersen, Tarik Hadzic, David Pisinger
JOLLI
2010
107views more  JOLLI 2010»
14 years 11 months ago
PGF: A Portable Run-time Format for Type-theoretical Grammars
Abstract PGF (Portable Grammar Format) is a low-level language used as a target of compiling grammars written in GF (Grammatical Framework). Low-level and simple, PGF is easy to re...
Krasimir Angelov, Björn Bringert, Aarne Ranta
129
Voted
CPAIOR
2011
Springer
14 years 4 months ago
Manipulating MDD Relaxations for Combinatorial Optimization
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
David Bergman, Willem Jan van Hoeve, John N. Hooke...