Sciweavers

5922 search results - page 177 / 1185
» Navigability of Complex Networks
Sort
View
PODC
2012
ACM
13 years 5 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
RECOMB
2008
Springer
16 years 3 months ago
Bootstrapping the Interactome: Unsupervised Identification of Protein Complexes in Yeast
Protein interactions and complexes are major components of biological systems. Recent genome-wide applications of tandem affinity purification (TAP) in yeast have increased signifi...
Caroline C. Friedel, Jan Krumsiek, Ralf Zimmer
SAB
2004
Springer
159views Optimization» more  SAB 2004»
15 years 8 months ago
Swarming Behavior Using Probabilistic Roadmap Techniques
While techniques exist for simulating swarming behaviors, these methods usually provide only simplistic navigation and planning capabilities. In this review, we explore the benefi...
O. Burçhan Bayazit, Jyh-Ming Lien, Nancy M....
WSC
2008
15 years 5 months ago
Research and analysis of simulation-based networks through multi-objective visualization
Visualization of individual network events is a crucial part of testing new network designs and analyzing network performance and efficiency. This research designed and developed ...
J. Mark Belue, Stuart H. Kurkowski, Scott R. Graha...
ANCS
2005
ACM
15 years 8 months ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan