1237 search results - page 47 / 248 » Abstract shade trees |
125
click to vote
CG
2000
Springer
15 years 8 months ago
2000
Springer
This paper proposes a new method for searching two-valued (binary) game trees in games like chess or Go. Lambda-search uses null-moves together with different orders of threat-sequ...
166
click to vote
ICALP
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
166
click to vote
WADS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
137
click to vote
ILP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper is concerned with generalization issues for a decision tree learner for structured data called Alkemy. Motivated by error bounds established in statistical lea...
133
click to vote
ILP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We study predicate selection functions (also known as splitting rules) for structural decision trees and propose two improvements to existing schemes. The first is in cl...