1376 search results - page 77 / 276 » Searching Trees: An Essay |
LREC
2010
15 years 1 months ago
2010
The current study presents a conversion and unification of the Penn Discourse TreeBank 2.0 under the XML format. The converted corpus allows for a simultaneous search for syntacti...
PVLDB
2010
14 years 10 months ago
2010
Large flash disks, or solid state drives (SSDs), have become an attractive alternative to magnetic hard disks, due to their high random read performance, low energy consumption a...
110
click to vote
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
129
click to vote
DATAMINE
1999
14 years 11 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
SAC
2005
ACM
15 years 5 months ago
2005
ACM
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...