435 search results - page 81 / 87 » Partitioning Search Spaces of a Randomized Search |
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
73
Voted
ESA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
ISSTA
2010
ACM
14 years 11 months ago
2010
ACM
Testing object-oriented (OO) software is critical because OO languages are commonly used in developing modern software systems. In testing OO software, one important and yet chall...
PVLDB
2008
14 years 9 months ago
2008
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
120
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...