3055 search results - page 140 / 611 » Randomized Search Trees |
NIPS
2001
14 years 3 days ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
ICWSM
2009
13 years 8 months ago
2009
The present study demonstrates how the emotional content of search terms and their eventual results affects the breadth of a users' search for information. We observed the qu...
ICML
2008
IEEE
14 years 11 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
DAM
2008
13 years 10 months ago
2008
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
INFORMATICALT
2000
13 years 10 months ago
2000
Many heuristics, such as simulated annealing, genetic algorithms, greedy randomized adaptive search procedures are stochastic. In this paper, we propose a deterministic heuristic a...