6251 search results - page 163 / 1251 » Randomness, Computability, and Density |
125
click to vote
ACMDIS
2006
ACM
15 years 7 months ago
2006
ACM
Randomness is being harnessed in the design of some interactive systems. This is observed in random blogs, random web searching, and in particular Apple's iPod Shuffle. Yet t...
188
Voted
CRYPTO
2003
Springer
15 years 9 months ago
2003
Springer
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...
140
click to vote
SMA
2010
ACM
15 years 4 months ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
133
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
116
click to vote
STOC
1999
ACM
15 years 8 months ago
1999
ACM
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...