3020 search results - page 428 / 604 » Optimal partition trees |
186
click to vote
ALGORITHMICA
2000
15 years 6 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
190
click to vote
IEEEPACT
2006
IEEE
16 years 15 days ago
2006
IEEE
As chip multiprocessors (CMPs) become increasingly mainstream, architects have likewise become more interested in how best to share a cache hierarchy among multiple simultaneous t...
188
click to vote
IPSN
2005
Springer
15 years 12 months ago
2005
Springer
— In this paper, we propose a quantizer design algorithm that is optimized for source localization in sensor networks. For this application, the goal is to minimize the amount of...
180
click to vote
CLOUD
2010
ACM
15 years 11 months ago
2010
ACM
Failures of any type are common in current datacenters, partly due to the higher scales of the data stored. As data scales up, its availability becomes more complex, while differe...
196
click to vote
DATE
1998
IEEE
15 years 10 months ago
1998
IEEE
As the "system-on-a-chip" concept is rapidly becoming a reality, time-to-market and product complexity push the reuse of complex macromodules. Circuits combining a varie...