3055 search results - page 167 / 611 » Randomized Search Trees |
92
Voted
LREC
2010
15 years 3 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...
134
Voted
TASE
2008
IEEE
15 years 2 months ago
2008
IEEE
This work intends to deal with the optimal kinematic synthesis problem of parallel manipulators under a unified framework. Observing that regular (e.g., hyper-rectangular) workspac...
136
click to vote
GECCO
2006
Springer
15 years 6 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...
155
click to vote
DATAMINE
1999
15 years 2 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...
COCOON
2009
Springer
15 years 9 months ago
2009
Springer
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...