Sciweavers

619 search results - page 72 / 124
» Random Bichromatic Matchings
Sort
View
HCW
1998
IEEE
14 years 1 months ago
Dynamic, Competitive Scheduling of Multiple DAGs in a Distributed Heterogeneous Environment
With the advent of large scale heterogeneous environments, there is a need for matching and scheduling algorithms which can allow multiple DAG-structured applications to share the...
Michael A. Iverson, Füsun Özgüner
GROUP
2007
ACM
14 years 24 days ago
That's what friends are for: facilitating 'who knows what' across group boundaries
We describe the design and evaluation of K-net, a social matching system to help people learn 'who knows what' in an organization by matching people with skills with tho...
N. Sadat Shami, Y. Connie Yuan, Dan Cosley, Ling X...
JCM
2008
94views more  JCM 2008»
13 years 9 months ago
Cell Site Power Characterization for Multi-rate Wireless CDMA Data Networks Using Lognormal Approximation
An analytical model is developed to solve the power-rate assignment problem for multi-rate CDMA systems and calculate the probability density function (PDF) for the downlink traffi...
Ashraf S. Hasan Mahmoud
JGAA
2007
135views more  JGAA 2007»
13 years 8 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
JPDC
2007
92views more  JPDC 2007»
13 years 8 months ago
Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment
In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. To maximize the performance of the system, it is ...
Jong-Kook Kim, Sameer Shivle, Howard Jay Siegel, A...