3055 search results - page 291 / 611 » Randomized Search Trees |
129
click to vote
CG
2006
Springer
15 years 5 months ago
2006
Springer
Temporal difference (TD) learning has been used to learn strong evaluation functions in a variety of two-player games. TD-gammon illustrated how the combination of game tree search...
120
Voted
ACL
2000
15 years 4 months ago
2000
We present an LFG-DOP parser which uses fragments from LFG-annotated sentences to parse new sentences. Experiments with the Verbmobil and Homecentre corpora show that (1) Viterbi ...
129
Voted
AI
2010
Springer
15 years 3 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
94
Voted
WWW
2004
ACM
16 years 4 months ago
2004
ACM
The goal of this research is the improvement of browsing voluminous InkML data in two areas: ease of rendering continuous inkflow for replay-browsing, and ease of random access na...
128
Voted
KBSE
2007
IEEE
15 years 9 months ago
2007
IEEE
Randomized testing has been shown to be an effective method for testing software units. However, the thoroughness of randomized unit testing varies widely according to the settin...