๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Parallel Algorithms for Partitioning Sorted Sets and Related Problems

โœ Scribed by D. Z. Chen, W. Chen, K. Wada and K. Kawaguchi

Book ID
120137127
Publisher
Springer
Year
2000
Tongue
English
Weight
272 KB
Volume
28
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Sorting and doubling techniques for set
Sorting and doubling techniques for set partitioning and automata minimization problems
โœ D. Ziadi ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 118 KB

In this paper we present an O(n 2 ) implementation of Moore's algorithm for automata minimization. It is based on an optimal sorting procedure and on basic data structures. We also deepen the link between set partitioning problem and automata minimization problem, and assess the applicability of the

Partitioning and parallel algorithms for
Partitioning and parallel algorithms for kidney models
โœ T.M. Hagstrom; R.P. Tewarson ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 243 KB

A natural partitioning exists for kidney models. For example, if all the variables and equations associated with boundary values and interstitim are classified as basic, then the equations and variables corresponding to each tube can be solved independently. It will be shm how partitioning technique