3055 search results - page 221 / 611 » Randomized Search Trees |
90
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
102
click to vote
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Various methods for ensemble selection and classifier combination have been designed to optimize the results of ensembles of classifiers. Genetic algorithm (GA) which uses the div...
125
click to vote
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
93
Voted
CORR
2010
Springer
15 years 28 days ago
2010
Springer
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
91
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...