Sciweavers

5448 search results - page 752 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
SAC
2004
ACM
16 years 7 days ago
A cost-oriented approach for infrastructural design
The selection of a cost-minimizing combination of hardware and network components that satisfy organizational requirements is a complex design problem with multiple degrees of fre...
Danilo Ardagna, Chiara Francalanci, Marco Trubian
BMCBI
2006
117views more  BMCBI 2006»
15 years 6 months ago
The Cluster Variation Method for Efficient Linkage Analysis on Extended Pedigrees
Background: Computing exact multipoint LOD scores for extended pedigrees rapidly becomes infeasible as the number of markers and untyped individuals increase. When markers are exc...
Cornelis A. Albers, Martijn A. R. Leisink, Hilbert...
HPCC
2009
Springer
15 years 4 months ago
Graph-Based Task Replication for Workflow Applications
Abstract--The Grid is an heterogeneous and dynamic environment which enables distributed computation. This makes it a technology prone to failures. Some related work uses replicati...
Raúl Sirvent, Rosa M. Badia, Jesús L...
ICPPW
2009
IEEE
15 years 4 months ago
A Scalable Parallel Approach for Peptide Identification from Large-Scale Mass Spectrometry Data
Identifying peptides, which are short polymeric chains of amino acid residues in a protein sequence, is of fundamental importance in systems biology research. The most popular appr...
Gaurav Ramesh Kulkarni, Ananth Kalyanaraman, Willi...
MOBIHOC
2002
ACM
16 years 6 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder