2110 search results - page 293 / 422 » What is the complexity of a distributed computing system |
154
Voted
SPAA
2004
ACM
15 years 10 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
115
click to vote
HPCA
1998
IEEE
15 years 8 months ago
1998
IEEE
Scalable shared-memory multiprocessors that are designed as Cache-Only Memory Architectures Coma allow automatic replication and migration of data in the main memory. This enhance...
243
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...
158
click to vote
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...
155
click to vote
HPDC
2010
IEEE
15 years 5 months ago
2010
IEEE
The explosion of data in the biological community demands the development of more scalable and flexible portals for bioinformatic computation. To address this need, we put forth c...