✦ LIBER ✦

A graph-based algorithm for the automated datapath synthesis of ASM

✍ Scribed by Yau Hwang Kuo; Jang Pong Hsu; Ling Yeung Kung

Publisher: Elsevier Science
Year: 1987
Weight: 450 KB
Volume: 21
Category: Article
ISSN: 0165-6074
DOI: 10.1016/0165-6074(87)90102-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Algorithm for r-Bases of a Directed G

An Algorithm for r-Bases of a Directed Graph

✍ J. R. Brown 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB 👁 1 views

A polynomial algorithm for constructing

A polynomial algorithm for constructing the clique graph of a line graph

✍ Bruce Hedman 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 250 KB

A graph-based, multi-resolution algorith

A graph-based, multi-resolution algorithm for tracking objects in presence of occlusions

✍ Donatello Conte; Pasquale Foggia; Jean-Michel Jolion; Mario Vento 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 468 KB

Performance of a genetic algorithm for t

Performance of a genetic algorithm for the graph partitioning problem

✍ Keiko Kohmoto; Kengo Katayama; Hiroyuki Narihisa 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 653 KB

MATHEMATICAL l OWl"lD ." \*ClaNCC d COMPUTER DIRmCT\* MODELLING Mathematical and Computer Modelling 38 (2003)

A minimum manual component insertion alg

A minimum manual component insertion algorithm for PCB assembly based on graph theory

✍ Thomas Lacksonen; Sanjay Joshi 📂 Article 📅 1990 🏛 Society of Manufacturing Engineers 🌐 English ⚖ 580 KB

A parallel algorithm for the enumeration

A parallel algorithm for the enumeration of the spanning trees of a graph

✍ Shao-Wen Mai; D.J. Evans 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 450 KB

As is well known, the strategy of divide-and-conquer is widely used in problem solving. The method of partitioning is also a fundamental strategy for the design of a parallel algorithm. The problem of enumerating the spanning trees of a graph arises in several contexts such as computer-aided design