151 search results - page 13 / 31 » P-Semiflow Computation with Decision Diagrams |
CSR
2006
Springer
15 years 3 months ago
2006
Springer
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applic...
82
Voted
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
We develop a new graphical representation for interactive partially observable Markov decision processes (I-POMDPs) that is significantly more transparent and semantically clear t...
AIPS
2003
15 years 1 months ago
2003
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To d...
92
Voted
SAC
2009
ACM
15 years 6 months ago
2009
ACM
We present a GPU-based algorithm for computing discretized distance functions on road networks. As applications, we provide algorithms for computing discrete Order-k Network Voron...
EICS
2009
ACM
15 years 4 months ago
2009
ACM
MoLIC, a modeling language for designing interaction as a metaphor of conversation, was proposed to allow designers to build a blueprint of all interaction that may take place whe...