Sciweavers

4539 search results - page 583 / 908
» Approaches to Compute Workflow Complexity
Sort
View
ICNS
2007
IEEE
16 years 29 days ago
DRR-SFF: A Practical Scheduling Algorithm to Improve the Performance of Short Flows
— Short flow first scheduling (SFF) strategy is effective in obtaining more stringent performance bounds for short flows in Internet. However, previous strict SFF approaches i...
Changhua Sun, Lei Shi, Chengchen Hu, Bin Liu
JOBIM
2000
15 years 10 months ago
InterDB, a Prediction-Oriented Protein Interaction Database for C. elegans
Protein-protein interactions are critical to many biological processes, extending from the formation of cellular macromolecular structures and enzymatic complexes to the regulation...
Nicolas Thierry-Mieg, Laurent Trilling
BMCBI
2007
203views more  BMCBI 2007»
15 years 6 months ago
A Grid-based solution for management and analysis of microarrays in distributed experiments
Several systems have been presented in the last years in order to manage the complexity of large microarray experiments. Although good results have been achieved, most systems ten...
Ivan Porro, Livia Torterolo, Luca Corradi, Marco F...
ICTAI
2010
IEEE
15 years 4 months ago
PKOPT: Faster k-Optimal Solution for DCOP by Improving Group Selection Strategy
A significant body of work in multiagent systems over more than two decades has focused on multi-agent coordination (1). Many challenges in multi-agent coordination can be modeled ...
Elnaz Bigdeli, Maryam Rahmaninia, Mohsen Afsharchi
TIT
2011
148views more  TIT 2011»
15 years 1 months ago
On Two-User Gaussian Multiple Access Channels With Finite Input Constellations
—Constellation Constrained (CC) capacity regions of two-user Single-Input Single-Output (SISO) Gaussian Multiple Access Channels (GMAC) are computed for several Non-Orthogonal Mu...
Jagadeesh Harshan, Bikash Sundar Rajan