2110 search results - page 413 / 422 » What is the complexity of a distributed computing system |
118
Voted
ANCS
2008
ACM
15 years 5 months ago
2008
ACM
Over the last decade, programmable Network Processors (NPs) have become widely used in Internet routers and other network components. NPs enable rapid development of complex packe...
127
Voted
JSA
2000
15 years 3 months ago
2000
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...
164
click to vote
ATAL
2011
Springer
14 years 3 months ago
2011
Springer
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
143
Voted
PODS
2007
ACM
16 years 3 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
131
click to vote
WWW
2010
ACM
15 years 10 months ago
2010
ACM
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new sys...