627 search results - page 76 / 126 » How optimal is the genetic code |
122
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
141
Voted
PC
2002
15 years 3 months ago
2002
The I/O access patterns of many parallel applications consist of accesses to a large number of small, noncontiguous pieces of data. If an application's I/O needs are met by m...
131
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations their com...
112
Voted
ICIP
1998
IEEE
16 years 5 months ago
1998
IEEE
Motion estimation represents the most computationally intensive task for all efficient motion compensated compression standards. This fact, despite the several eflorts aiming at r...
129
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...