Recently researchers working in the LFG framework have proposed algorithms for taking advantage of the implicit context-free components of a unification grammar [Maxwell and Kapla...
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
— For mobile platforms with steerable standard wheels it is necessary to precisely coordinate rotation and steering angle of their wheels. Especially for redundantly actuated pla...
Christian Pascal Connette, Andreas Pott, Martin H&...
Search based solvers for Quantified Boolean Formulas (QBF) have adapted the SAT solver techniques of unit propagation and clause learning to prune falsifying assignments. The tech...
This paper compares several translation representations for a synchronous context-free grammar parse including CFGs/hypergraphs, finite-state automata (FSA), and pushdown automat...
Gonzalo Iglesias, Cyril Allauzen, William Byrne, A...