243 search results - page 10 / 49 » On Balanced Graphs |
ICPP
1999
IEEE
15 years 1 months ago
1999
IEEE
This paper describes a novel compile-time list-based task scheduling algorithm for distributed-memory systems, called Fast Load Balancing (FLB). Compared to other typical list sch...
IWOMP
2009
Springer
15 years 4 months ago
2009
Springer
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
143
Voted
PAKDD
2011
ACM
14 years 15 days ago
2011
ACM
A structural similarity kernel is presented in this paper for SVM learning, especially for learning with imbalanced datasets. Kernels in SVM are usually pairwise, comparing the sim...