Sciweavers

3321 search results - page 582 / 665
» The Future of Knowledge Representation
Sort
View
ML
2010
ACM
210views Machine Learning» more  ML 2010»
13 years 6 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...
PKDD
2010
Springer
122views Data Mining» more  PKDD 2010»
13 years 6 months ago
Exploration in Relational Worlds
Abstract. One of the key problems in model-based reinforcement learning is balancing exploration and exploitation. Another is learning and acting in large relational domains, in wh...
Tobias Lang, Marc Toussaint, Kristian Kersting
RV
2010
Springer
141views Hardware» more  RV 2010»
13 years 6 months ago
Aspect-Oriented Instrumentation with GCC
We present the InterAspect instrumentation framework for GCC, a widely used compiler infrastructure. The addition of plugin support in the latest release of GCC makes it an attract...
Justin Seyster, Ketan Dixit, Xiaowan Huang, Radu G...
AAAI
2010
13 years 5 months ago
A Lower Bound on the Size of Decomposable Negation Normal Form
We consider in this paper the size of a Decomposable Negation Normal Form (DNNF) that respects a given vtree (known as structured DNNF). This representation of propositional knowl...
Thammanit Pipatsrisawat, Adnan Darwiche
ICGI
2010
Springer
13 years 5 months ago
Exact DFA Identification Using SAT Solvers
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
Marijn J. H. Heule, Sicco Verwer