3223 search results - page 365 / 645 » The Scaling of Search Cost |
153
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining Ò data values in the first Ò locatio...
167
Voted
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
In this paper, we present a constraint programming approach for the service consolidation problem that is being currently tackled by Neptuny, Milan. The problem is defined as: Giv...
179
click to vote
FSE
2010
Springer
15 years 11 months ago
2010
Springer
ESSENCE is a hash function submitted to the NIST Hash Competition that stands out as a hardware-friendly and highly parallelizable design. Previous analysis showed some non-randomn...
190
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
174
click to vote
ACNS
2006
Springer
15 years 10 months ago
2006
Springer
CPU bound client puzzles have been suggested as a defense mechanism against connection depletion attacks. However, the wide disparity in CPU speeds prevents such puzzles from being...