1376 search results - page 128 / 276 » Searching Trees: An Essay |
168
click to vote
ICALP
2001
Springer
15 years 11 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...
184
click to vote
WISE
2009
Springer
16 years 1 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...
183
click to vote
ISCC
2006
IEEE
16 years 15 days ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
159
click to vote
CIKM
2005
Springer
16 years 14 hour 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...
148
click to vote
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...