3946 search results - page 190 / 790 » The computational complexity of choice sets |
171
click to vote
ICDCS
1996
IEEE
15 years 10 months ago
1996
IEEE
This paper presents a detailed comparison of the relative importance of allowing concurrent writers versus the choice of the underlying consistency model. Our comparison is based ...
147
click to vote
PODC
1996
ACM
15 years 10 months ago
1996
ACM
Drawing ideas from previous authors, we present a new non-blocking concurrent queue algorithm and a new twolock queue algorithm in which one enqueue and one dequeue can proceed co...
162
click to vote
IFIP
2004
Springer
15 years 12 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
135
click to vote
SG
2010
Springer
15 years 11 months ago
2010
Springer
This paper is an artist statement describing a manipulation of the Mandelbrot Set equation as the basis for creating semi-figurative images, using a genetic algorithm. Modernist pa...
194
click to vote
GRC
2008
IEEE
15 years 7 months ago
2008
IEEE
—Secure multiparty computation is a very important research topic in cryptography. A secure multi-party computation involves N untrusful parties. It takes input xi from the ith p...