3055 search results - page 70 / 611 » Randomized Search Trees |
107
Voted
ISSRE
2002
IEEE
15 years 6 months ago
2002
IEEE
Formal analysis of software is a powerful analysis tool, but can be too costly. Random search of formal models can reduce that cost, but is theoretically incomplete. However, rand...
106
Voted
AMAI
2004
Springer
15 years 6 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
104
Voted
PKDD
2000
Springer
15 years 4 months ago
2000
Springer
A new approach to the induction of multivariate decision trees is proposed. A linear decision function (hyper-plane) is used at each non-terminal node of a binary tree for splittin...
125
Voted
CLEF
2009
Springer
14 years 11 months ago
2009
Springer
In this paper, we describe an approach for the automatic medical image annotation task of the 2009 CLEF cross-language image retrieval campaign (ImageCLEF). This work is focused o...
130
Voted
FSTTCS
2004
Springer
15 years 6 months ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...