✦ LIBER ✦

Efficient algorithms for path partitions

✍ Scribed by Craig Williams; Dana Richards

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 763 KB
Volume: 27
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(90)90070-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient algorithms for some path parti

Efficient algorithms for some path partitioning problems

✍ Peter Brucker 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 471 KB

Efficient heuristic algorithms for path-

Efficient heuristic algorithms for path-based hardware/software partitioning

✍ Jigang Wu; Thambipillai Srikanthan; Ting Lei 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 606 KB

Algorithmic aspects for power-efficient

Algorithmic aspects for power-efficient hardware/software partitioning

✍ Jigang Wu; Thambipillai Srikanthan; Chengbin Yan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 294 KB

An efficient clustering algorithm for pa

An efficient clustering algorithm for partitioning parallel programs

✍ Piyush Maheshwari; Hong Shen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 254 KB

This paper presents a clustering algorithm that partitions node-labelled and edge-labelled Ž . directed acyclic precedence graphs APG into clusters such that all the clusters have balanced amount of computation load and there is only one communication path between any pair of clusters. The algorithm

An efficient algorithm for K shortest si

An efficient algorithm for K shortest simple paths

✍ N. Katoh; T. Ibaraki; H. Mine 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 878 KB

On a trie partitioning algorithm for pow

On a trie partitioning algorithm for power-efficient TCAMs

✍ Haibin Lu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 391 KB