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

An efficient compensation-path finding algorithm for a large-scale processor array

โœ Scribed by Takao Ozawa


Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
905 KB
Volume
22
Category
Article
ISSN
0882-1666

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An efficient algorithm for finding a pat
โœ Turgay Korkmaz; Marwan Krunz; Spyros Tragoudas ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 616 KB

One of the key issues in providing end-to-end quality-of-service (QoS) guarantees in packet networks is how to determine a feasible path that satisยฎes a number of QoS constraints. For two or more additive constraints, the problem of ยฎnding a feasible path is NP-complete that cannot be exactly solved