3446 search results - page 462 / 690 » A Reasoning Algorithm for pD* |
143
click to vote
AAAI
2007
15 years 8 months ago
2007
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...
136
click to vote
AAAI
2007
15 years 8 months ago
2007
We present a CNF to Tree-of-BDDs (ToB) compiler with complexity at most exponential in the tree width. We then present algorithms for interesting queries on ToB. Although some of ...
179
click to vote
ICIA
2007
15 years 8 months ago
2007
We address the problem of users creating visualizations to debug and understand multi-agent systems. The key challenges are that (1) needs arise dynamically, i.e., it is difficult...
175
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Previous work on Natural Language Processing for Information Retrieval has shown the inadequateness of semantic and syntactic structures for both document retrieval and categoriza...
141
click to vote
ASPDAC
2005
ACM
15 years 7 months ago
2005
ACM
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...