4198 search results - page 68 / 840 » In search of lost time |
183
click to vote
DAMON
2009
Springer
15 years 7 months ago
2009
Springer
This paper presents novel tree-based search algorithms that exploit the SIMD instructions found in virtually all modern processors. The algorithms are a natural extension of binar...
179
click to vote
ACMSE
2010
ACM
15 years 3 months ago
2010
ACM
Most present day search engines have a deterministic behavior in the sense that they return the same search results for all users who submit the same query at a certain time. They...
162
click to vote
IPM
2007
15 years 5 months ago
2007
The performance of parallel query processing in a cluster of index servers is crucial for modern web search systems. In such a scenario, the response time basically depends on the...
136
click to vote
HEURISTICS
2002
15 years 5 months ago
2002
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
171
click to vote
GLOBECOM
2008
IEEE
16 years 9 days ago
2008
IEEE
— Recently, a maximum likelihood (ML) detection rule for differential unitary space time modulation (DUSTM) under the existence of unknown carrier frequency offset (CFO) has been...