Sciweavers

6251 search results - page 138 / 1251
» Randomness, Computability, and Density
Sort
View
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
15 years 10 months ago
A study of mutational robustness as the product of evolutionary computation
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
Justin Schonfeld
152
Voted
FSTTCS
1998
Springer
15 years 8 months ago
Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation
Molecular Computation (MC) is massively parallel computation where data is stored and processed within objects of molecular size. Biomolecular Computation (BMC) is MC using biotec...
John H. Reif
137
Voted
DSN
2004
IEEE
15 years 7 months ago
The Recursive NanoBox Processor Grid: A Reliable System Architecture for Unreliable Nanotechnology Devices
Advanced molecular nanotechnology devices are expected to have exceedingly high transient fault rates and large numbers of inherent device defects compared to conventional CMOS de...
A. J. KleinOsowski, Kevin KleinOsowski, Vijay Rang...
109
Voted
SIGOPS
2008
119views more  SIGOPS 2008»
15 years 3 months ago
Project Kittyhawk: building a global-scale computer: Blue Gene/P as a generic computing platform
This paper describes Project Kittyhawk, an undertaking at IBM Research to explore the construction of a nextgeneration platform capable of hosting many simultaneous web-scale work...
Jonathan Appavoo, Volkmar Uhlig, Amos Waterland
164
Voted
ECCC
2011
204views ECommerce» more  ECCC 2011»
14 years 7 months ago
Dense locally testable codes cannot have constant rate and distance
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
Irit Dinur, Tali Kaufman