Sciweavers

1698 search results - page 324 / 340
» Growing Complex Games
Sort
View
BMCBI
2005
126views more  BMCBI 2005»
14 years 9 months ago
HomoMINT: an inferred human network based on orthology mapping of protein interactions discovered in model organisms
Background: The application of high throughput approaches to the identification of protein interactions has offered for the first time a glimpse of the global interactome of some ...
Maria Persico, Arnaud Ceol, Caius Gavrila, Robert ...
TVLSI
2008
187views more  TVLSI 2008»
14 years 9 months ago
A Design Flow for Architecture Exploration and Implementation of Partially Reconfigurable Processors
During the last years, the growing application complexity, design, and mask costs have compelled embedded system designers to increasingly consider partially reconfigurable applica...
Kingshuk Karuri, Anupam Chattopadhyay, Xiaolin Che...
BMCBI
2002
108views more  BMCBI 2002»
14 years 9 months ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy
JSA
2000
115views more  JSA 2000»
14 years 9 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani
MST
2002
107views more  MST 2002»
14 years 9 months ago
A Comparison of Asymptotically Scalable Superscalar Processors
The poor scalability of existing superscalar processors has been of great concern to the computer engineering community. In particular, the critical-path lengths of many components...
Bradley C. Kuszmaul, Dana S. Henry, Gabriel H. Loh