Consider the problem of partitioning n nonnegative numbers into p parts, where part i can be assigned ni numbers with ni lying in a given range. The goal is to maximize a Schur con...
F. H. Chang, H. B. Chen, J. Y. Guo, Frank K. Hwang...
The paper presents a new data partitioning algorithm for parallel computing on heterogeneous processors. Like traditional functional partitioning algorithms, the algorithm assumes ...
This paper presents an algorithm to compute the value of the inverse Laplace transforms of rational functions with poles on arrangements of hyperplanes. As an application, we prese...
M. Welleda Baldoni-Silva, Matthias Beck, Charles C...
Abstract Mesh partitioning and skeletonisation are fundamental for many computer graphics and animation techniques. Because of the close link between an object's skeleton and ...
Partitioning a system among multiple input and output pin I O limited packages is a widely researched and hard to solve problem. We previously described a new approach yielding ...