3616 search results - page 62 / 724 » Conditional Memory Ordering |
108
click to vote
AAAI
1998
15 years 5 months ago
1998
RecentlyFtwo new backtracking algorithmsF dynamic backtracking (DB)and partial order dynamicbacktracking (PDB) have been presented. These algorithms have the property to be additi...
142
click to vote
ILP
2004
Springer
15 years 9 months ago
2004
Springer
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
151
click to vote
FOIKS
2008
Springer
15 years 5 months ago
2008
Springer
The area of knowledge merging is concerned with merging conflicting information while preserving as much as possible. Most proposals in the literature work with knowledge bases exp...
134
click to vote
AMAI
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimizati...
177
click to vote
Publication
We present a simple, effective generalisation of variable order Markov
models to full online Bayesian estimation. The mechanism used is close
to that employed in context tree wei...