Sciweavers

2754 search results - page 216 / 551
» Distributed Weighted Matching
Sort
View
ICPADS
2007
IEEE
15 years 9 months ago
Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
Hoda Akbari, Zeinab Iranmanesh, Mohammad Ghodsi
AI
2007
Springer
15 years 9 months ago
Improving Importance Sampling by Adaptive Split-Rejection Control in Bayesian Networks
Importance sampling-based algorithms are a popular alternative when Bayesian network models are too large or too complex for exact algorithms. However, importance sampling is sensi...
Changhe Yuan, Marek J. Druzdzel
EUROPAR
2003
Springer
15 years 8 months ago
Dynamic Load Balancing for I/O- and Memory-Intensive Workload in clusters Using a Feedback Control Mechanism
1 One common assumption of the existing models of load balancing is that the weights of resources and I/O buffer size are statically configured. Though the static configuration ...
Xiao Qin, Hong Jiang, Yifeng Zhu, David R. Swanson
122
Voted
FCT
2009
Springer
15 years 7 months ago
1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs
Abstract. In the frequency allocation problem we are given a cellular telephone network whose geographical coverage area is divided into cells where phone calls are serviced by fre...
Rafal Witkowski
111
Voted
NIPS
2008
15 years 4 months ago
Generative and Discriminative Learning with Unknown Labeling Bias
We apply robust Bayesian decision theory to improve both generative and discriminative learners under bias in class proportions in labeled training data, when the true class propo...
Miroslav Dudík, Steven J. Phillips