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

Improved upper and lower bounds for k-broadcasting

โœ Scribed by Hovhannes A. Harutyunyan; Arthur L. Liestman

Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
150 KB
Volume
37
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Upper and lower bounds for local electro
Upper and lower bounds for local electromagnetic quantities
โœ R. Albanese; R. Fresa ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 155 KB ๐Ÿ‘ 1 views

Most engineering problems are solved by means of numerical methods that are able to provide only approximate solutions, for which it would be extremely useful to have efficient error estimators. Upper and lower bounds for quantities of integral character, like the stored magnetic energy or the ohmi

Improved upper bounds for the atomic ion
Improved upper bounds for the atomic ionization potential
โœ J. C. Angulo; E. Romera ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 259 KB ๐Ÿ‘ 2 views

Two sets of rigorous upper bounds on the atomic ionization potential are derived from some known inequalities of the classical analysis. The first set of bounds are expressed in terms of radial expectation values of the electron density; they improve previously found bounds of the same kind and conv

Upper and lower bounds for the average-c
Upper and lower bounds for the average-case complexity of path-search
โœ Pippenger, Nicholas ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 125 KB ๐Ÿ‘ 1 views

A channel graph is the union of all paths between a given input and a given output in an interconnection network. At any moment in time, each vertex in such a graph is either idle or busy. The search problem that we consider is to find a path (from the given input to the given output) consisting ent