Sciweavers

7758 search results - page 378 / 1552
» On the Number of Distributive Lattices
Sort
View
SPAA
2005
ACM
16 years 11 days ago
Name independent routing for growth bounded networks
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
Ittai Abraham, Dahlia Malkhi
172
Voted
HPDC
2003
IEEE
16 years 3 days ago
Adaptive Polling of Grid Resource Monitors Using a Slacker Coherence Model
As Data and Computational Grids grow in size and complexity, the crucial task of identifying, monitoring and utilizing available resources in an efficient manner is becoming incr...
Radhakrishnan Sundaresan, Mario Lauria, Tahsin M. ...
ICDCS
2003
IEEE
16 years 2 days ago
The Hash History Approach for Reconciling Mutual Inconsistency
We introduce the hash history mechanism for capturing dependencies among distributed replicas. Hash histories, consisting of a directed graph of version hashes, are independent of...
ByungHoon Kang, Robert Wilensky, John Kubiatowicz
ICDCS
2000
IEEE
15 years 11 months ago
Partitionable Light-Weight Groups
Group communication, providing virtual synchrony semantics, is a powerful paradigm for building distributed applications. For applications that require a large number of groups, s...
Luís Rodrigues, Katherine Guo
CSB
2004
IEEE
125views Bioinformatics» more  CSB 2004»
15 years 10 months ago
Gene Length and Alternative Transcription in Fruit Fly
Alternative transcription, in which a single gene may give rise to multiple variant mRNA forms, is widely recognized as an important source of protein diversity in complex, eukary...
Boris Budagyan, Ann E. Loraine