216 search results - page 16 / 44 » The Complexity of Planning Problems With Simple Causal Graph... |
EMNLP
2008
13 years 9 months ago
2008
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
INFORMATICALT
2007
13 years 7 months ago
2007
A modified version of the Bellare and Rogaway (1993) adversarial model is encoded using Asynchronous Product Automata (APA). A model checker tool, Simple Homomorphism Verificatio...
SYNASC
2006
IEEE
14 years 1 months ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
FOCS
1998
IEEE
13 years 12 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...