Sciweavers

636 search results - page 96 / 128
» Computational Engineering and Science Program at the Univers...
Sort
View
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
13 years 12 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 8 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
GECCO
2008
Springer
116views Optimization» more  GECCO 2008»
13 years 9 months ago
Evolving similarity functions for code plagiarism detection
Students are often asked to submit electronic copies of their program code as part of assessment in computer science courses. To counter code plagiarism, educational institutions ...
Victor Ciesielski, Nelson Wu, Seyed M. M. Tahaghog...
ICS
1998
Tsinghua U.
14 years 1 days ago
Techniques for Empirical Testing of Parallel Random Number Generators
Parallel computers are now commonly used for computational science and engineering, and many applications in these areas use random number generators. For some applications, such ...
Paul D. Coddington, Sung Hoon Ko
ACMSE
2007
ACM
13 years 12 months ago
A self-testing autonomic container
Many strategies have been proposed to address the problems associated with managing increasingly complex computing systems. IBM's Autonomic Computing (AC) paradigm is one suc...
Ronald Stevens, Brittany Parsons, Tariq M. King