3455 search results - page 340 / 691 » Generalized Game Trees |
163
click to vote
CONCUR
1998
Springer
15 years 11 months ago
1998
Springer
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest viewing PA-processes as trees, and using treeautomata technique...
184
click to vote
KDD
1994
ACM
15 years 10 months ago
1994
ACM
: The problem of transforming the knowledge bases of performance systems using induced rules or decision trees into comprehensible knowledgestructures is addressed. A knowledgestru...
149
click to vote
AMAST
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Accumulation techniques were invented to transform functional programs, which intensively use append functions (like inefficient list reversal), into more efficient progr...
166
click to vote
ACL
2006
15 years 8 months ago
2006
We investigate generalizations of the allsubtrees "DOP" approach to unsupervised parsing. Unsupervised DOP models assign all possible binary trees to a set of sentences ...
178
click to vote
IJCAI
2003
15 years 8 months ago
2003
Most recent research of scalable inductive learning on very large dataset, decision tree construction in particular, focuses on eliminating memory constraints and reducing the num...