Sciweavers

2381 search results - page 42 / 477
» Take Advantage of the Computing Power of DNA Computers
Sort
View
NIPS
2007
13 years 10 months ago
Computing Robust Counter-Strategies
Adaptation to other initially unknown agents often requires computing an effective counter-strategy. In the Bayesian paradigm, one must find a good counterstrategy to the inferre...
Michael Johanson, Martin Zinkevich, Michael H. Bow...
COMPSAC
2011
IEEE
12 years 8 months ago
Dynamic Request Management Algorithms for Web-Based Services in Cloud Computing
—Providers of Web-based services can take advantage of many convenient features of cloud computing infrastructures, but they still have to implement request management algorithms...
Riccardo Lancellotti, Mauro Andreolini, Claudia Ca...
ICS
2010
Tsinghua U.
14 years 1 months ago
Cache oblivious parallelograms in iterative stencil computations
We present a new cache oblivious scheme for iterative stencil computations that performs beyond system bandwidth limitations as though gigabytes of data could reside in an enormou...
Robert Strzodka, Mohammed Shaheen, Dawid Pajak, Ha...
JCC
2008
166views more  JCC 2008»
13 years 8 months ago
Reference energy extremal optimization: A stochastic search algorithm applied to computational protein design
: We adapt a combinatorial optimization algorithm, extremal optimization (EO), for the search problem in computational protein design. This algorithm takes advantage of the knowled...
Naigong Zhang, Chen Zeng
PAIRING
2010
Springer
153views Cryptology» more  PAIRING 2010»
13 years 7 months ago
Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves
This paper presents a novel method for designing compact yet efficient hardware implementations of the Tate pairing over supersingular curves in small characteristic. Since such cu...
Nicolas Estibals