627 search results - page 107 / 126 » How optimal is the genetic code |
129
Voted
CODES
2011
IEEE
14 years 19 days ago
2011
IEEE
Designing memory controllers for complex real-time and highperformance multi-processor systems-on-chip is challenging, since sufficient capacity and (real-time) performance must b...
101
click to vote
STOC
2012
ACM
13 years 3 months ago
2012
ACM
In this work we describe an explicit, simple, construction of large subsets of Fn , where F is a finite field, that have small intersection with every k-dimensional affine subsp...
119
click to vote
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
Hybrid algorithms that combine genetic algorithms with the Nelder-Mead simplex algorithm have been effective in solving certain optimization problems. In this article, we apply a s...
JPDC
2006
15 years 23 days ago
2006
The rapid growth of heterogeneous devices and diverse networks in our daily life, makes it is very difficult, if not impossible, to build a one-size-fits-all application or protoc...
88
Voted
EUROSYS
2010
ACM
15 years 10 months ago
2010
ACM
Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20.000 lines of challenging C++ code encompassing synchronization, networking and cryptogra...