Sciweavers

5922 search results - page 504 / 1185
» Navigability of Complex Networks
Sort
View
SBACPAD
2007
IEEE
128views Hardware» more  SBACPAD 2007»
16 years 12 days ago
Node Level Primitives for Parallel Exact Inference
We present node level primitives for parallel exact inference on an arbitrary Bayesian network. We explore the probability representation on each node of Bayesian networks and eac...
Yinglong Xia, Viktor K. Prasanna
ICNP
1999
IEEE
15 years 10 months ago
Minimum Rate Guarantee Without Per-Flow Information
This paper introduces a scalable maxmin flow control protocol which guarantees the minimum rate for each connection-oriented flow without requiring per-flow information. The proto...
Yuseok Kim, Wei Kang Tsai, Mahadevan Iyer, Jordi R...
ATAL
2008
Springer
15 years 8 months ago
An approach to online optimization of heuristic coordination algorithms
Due to computational intractability, large scale coordination algorithms are necessarily heuristic and hence require tuning for particular environments. In domains where character...
Jumpol Polvichai, Paul Scerri, Michael Lewis
BMCBI
2010
132views more  BMCBI 2010»
15 years 6 months ago
An interaction-motif-based scoring function for protein-ligand docking
Background: A good scoring function is essential for molecular docking computations. In conventional scoring functions, energy terms modeling pairwise interactions are cumulativel...
Zhong-Ru Xie, Ming-Jing Hwang
147
Voted
CN
2006
75views more  CN 2006»
15 years 6 months ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon