2107 search results - page 135 / 422 » Computing Small Search Numbers in Linear Time |
261
Voted
IPM
2007
15 years 3 months ago
2007
We consider a network of autonomous peers forming a logically global but physically distributed search engine, where every peer has its own local collection generated by independe...
EOR
2008
15 years 3 months ago
2008
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
149
Voted
ICMCS
2005
IEEE
15 years 9 months ago
2005
IEEE
The new video coding standard, H.264 allows motion estimation performing on tree-structured block partitioning and multiple reference frames. This feature improves the prediction ...
108
Voted
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
Multi colony ant algorithms are evolutionary optimization heuristics that are well suited for parallel execution. Information exchange between the colonies is an important topic th...
124
Voted
BIRTHDAY
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Database preprocessing in order to create an index often permits considerable speedup in search compared to the iterated query of an unprocessed database. In this paper w...