2774 search results - page 293 / 555 » Exploiting Deep Structure |
176
click to vote
CAV
2008
Springer
15 years 8 months ago
2008
Springer
Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...
147
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
It has been shown that Binary Decision Diagram (BDD) based logic synthesis enjoys faster runtime than the classic logic synthesis systems based on Sum of Product (SOP) form. Howev...
154
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
We present an incremental refinement algorithm for approximate compilation of constraint satisfaction models into multivalued decision diagrams (MDDs). The algorithm uses a vertex ...
172
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
166
click to vote
AAAI
2010
15 years 8 months ago
2010
Existing controller-based approaches for centralized and decentralized POMDPs are based on automata with output known as Moore machines. In this paper, we show that several advant...