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

An efficient algorithm for finding a two-pair, and its applications

โœ Scribed by Srinivasa R. Arikati; C. Pandu Rangan

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
190 KB
Volume
31
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient algorithm for finding a pat
An efficient algorithm for finding a path subject to two additive constraints
โœ 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

An iterative algorithm for finding a nea
An iterative algorithm for finding a nearest pair of points in two convex subsets of Rn
โœ B. Llanas; M. Fernandez de Sevilla; V. Feliu ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 536 KB

We present an algorithm for finding a nearest pair of points in two convex sets of R n, and therefore, their distance. The algorithm is based on the fixed-point theory of nonexpansive operators on a Hilbert space. Its practical implementation requires a fast projection algorithm. We introduce such a

An Algorithm for Finding Recurrence Rela
An Algorithm for Finding Recurrence Relations of Binomial Sums and its Complexity
โœ Nobuki Takayama ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 355 KB

A new algorithm to find recurrence relations of binomial sums and a complexity analysis are given. The algorithm is based on the theory of hypergeometric functions and algorithmic method to get contiguity relations of hyperegeometric functions.