Sciweavers

627 search results - page 121 / 126
» How optimal is the genetic code
Sort
View
SIGCOMM
2005
ACM
14 years 29 days ago
Using redundancy to cope with failures in a delay tolerant network
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
Sushant Jain, Michael J. Demmer, Rabin K. Patra, K...
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
14 years 26 days ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader
GECCO
2008
Springer
122views Optimization» more  GECCO 2008»
13 years 8 months ago
Evolving machine microprograms
The realization of a control unit can be done using a complex circuitry or microprogramming. The latter may be considered as an alternative method of implementation of machine ins...
Pedro A. Castillo Valdivieso, G. Fernández,...
BMCBI
2006
110views more  BMCBI 2006»
13 years 7 months ago
Design of a combinatorial DNA microarray for protein-DNA interaction studies
Background: Discovery of precise specificity of transcription factors is an important step on the way to understanding the complex mechanisms of gene regulation in eukaryotes. Rec...
Julian Mintseris, Michael B. Eisen
TIT
2008
90views more  TIT 2008»
13 years 7 months ago
Scanning and Sequential Decision Making for Multidimensional Data - Part II: The Noisy Case
We consider the problem of sequential decision making for random fields corrupted by noise. In this scenario, the decision maker observes a noisy version of the data, yet judged wi...
Asaf Cohen, Tsachy Weissman, Neri Merhav