Sciweavers

972 search results - page 177 / 195
» Performance of data networks with random links
Sort
View
FAST
2008
14 years 11 months ago
Pergamum: Replacing Tape with Energy Efficient, Reliable, Disk-Based Archival Storage
As the world moves to digital storage for archival purposes, there is an increasing demand for reliable, lowpower, cost-effective, easy-to-maintain storage that can still provide ...
Mark W. Storer, Kevin M. Greenan, Ethan L. Miller,...
BIOINFORMATICS
2008
203views more  BIOINFORMATICS 2008»
14 years 9 months ago
The SGN comparative map viewer
Background: A common approach to understanding the genetic basis of complex traits is through identification of associated quantitative trait loci (QTL). Fine mapping QTLs require...
Lukas A. Mueller, Adri A. Mills, Beth Skwarecki, R...
HPDC
2007
IEEE
15 years 3 months ago
A fast topology inference: a building block for network-aware parallel processing
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
Tatsuya Shirai, Hideo Saito, Kenjiro Taura
INFOCOM
2006
IEEE
15 years 3 months ago
Controlled Flooding Search with Delay Constraints
— In this paper we consider the problem of query and search in a network, e.g., searching for a specific node or a piece of data. We limit our attention to the class of TTL (tim...
Nicholas B. Chang, Mingyan Liu
CP
2007
Springer
15 years 1 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti