3223 search results - page 135 / 645 » The Scaling of Search Cost |
198
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
151
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Questions about order versus disorder in systems and models have been fascinating scientists over the years. In Computer Science, order is intimately related to sorting, commonly ...
167
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
170
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
191
click to vote
PSB
2003
15 years 7 months ago
2003
A number of biological applications require comparison of large genome strings. Current techniques suffer from both disk I/O and computational cost because of extensive memory req...