357 search results - page 22 / 72 » Analysis of Transposition-Table-Driven Work Scheduling in Di... |
108
Voted
BIRTHDAY
2003
Springer
15 years 8 months ago
2003
Springer
The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundament...
128
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
134
click to vote
SIGMETRICS
2008
ACM
15 years 3 months ago
2008
ACM
We consider a wireless collision channel, shared by a finite number of mobile users who transmit to a common base station using a random access protocol. Mobiles are selfoptimizin...
101
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper explores the correlation of instruction counts and cache misses to runtime performance for a large family of divide and conquer algorithms to compute the Walsh–Hadama...
195
Voted
PODS
1997
ACM
15 years 7 months ago
1997
ACM
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...