1461 search results - page 160 / 293 » The Cost of Cache-Oblivious Searching |
189
click to vote
FTDCS
2003
IEEE
16 years 8 days ago
2003
IEEE
We propose a new model for on-demand media streaming centered around the peer-to-peer (P2P) paradigm. The proposed P2P model can support a large number of clients with a low overa...
154
click to vote
ICRA
2003
IEEE
16 years 8 days ago
2003
IEEE
We present an online algorithm for planning sequences of footstep locations that encode goal-directed navigation strategies for humanoid robots. Planning footsteps is more general...
173
Voted
SPAA
2003
ACM
16 years 6 days ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
159
click to vote
FOCS
2002
IEEE
15 years 12 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...
174
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...