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

Properties of control-flow complexity measures

โœ Scribed by Lakshmanan, K.B.; Jayaprakash, S.; Sinha, P.K.


Book ID
117871922
Publisher
IEEE
Year
1991
Tongue
English
Weight
668 KB
Volume
17
Category
Article
ISSN
0098-5589

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Complicated measures of complexity
โœ Maddox, John ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Nature Publishing Group ๐ŸŒ English โš– 135 KB
Convergence Complexity of Optimistic Rat
โœ Yehuda Afek; Yishay Mansour; Zvi Ostfeld ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 235 KB

This paper studies basic properties of rate-based flow-control algorithms and of the max-min fairness criteria. For the algorithms we suggest a new approach for their modeling and analysis, which may be considered more ''optimistic'' and realistic than traditional approaches. Three variations of the

Complexity measures of sign matrices
โœ Nati Linial; Shahar Mendelson; Gideon Schechtman; Adi Shraibman ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 293 KB
Equivalence of Measures of Complexity Cl
โœ Breutzmann, Josef M.; Lutz, Jack H. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 274 KB