4095 search results - page 16 / 819 » How to test a tree |
SIGIR
2003
ACM
14 years 28 days ago
2003
ACM
Question classification is very important for question answering. This paper presents our research work on automatic question classification through machine learning approaches. W...
CP
2008
Springer
13 years 9 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
AAAI
2006
13 years 9 months ago
2006
We derive a recursive formula for expected utility values in imperfect- information game trees, and an imperfectinformation game tree search algorithm based on it. The formula and...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We consider the wavelet transform of a finite, rooted, node-ranked, p-way tree, focusing on the case of binary (p = 2) trees. We study a Haar wavelet transform on this tree. Wave...
CCL
1994
Springer
13 years 11 months ago
1994
Springer
We employ the model-theoretic method of Ehrenfeucht-Fra sse Games to prove the completeness of the theory CFT, which has been introduced in 22] for describing rational trees in a ...