3055 search results - page 271 / 611 » Randomized Search Trees |
129
click to vote
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
130
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
151
click to vote
EC
2006
15 years 3 months ago
2006
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
144
click to vote
WISE
2009
Springer
15 years 10 months ago
2009
Springer
Results clustering in Web Searching is useful for providing users with overviews of the results and thus allowing them to restrict their focus to the desired parts. However, the ta...
111
click to vote
CIKM
2005
Springer
15 years 8 months ago
2005
Springer
A framework for describing semantic relationships among nodes in XML documents is presented. In contrast to earlier work, the XML documents may have ID references (i.e., they corr...