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

A note on tariffication strategy cases in telecommunications

โœ Scribed by Gustav Cepciansky; Ladislav Schwartz

Publisher
Springer
Year
2008
Tongue
English
Weight
269 KB
Volume
9
Category
Article
ISSN
1385-9587

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A note on strategy elimination in bimatr
A note on strategy elimination in bimatrix games
โœ Donald E. Knuth; Christos H. Papadimitriou; John N. Tsitsiklis ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 484 KB
A note on Bertsekas' small-label-first s
A note on Bertsekas' small-label-first strategy
โœ Chen, Zhi-Long; Powell, Warren B. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 103 KB ๐Ÿ‘ 1 views

An example is presented to show that the worst-case complexity of Bertsekas' small-labelfirst strategy for the shortest path problem is exponential. It becomes polynomial if, when scanning a node i, its successors j โˆš G(i) are examined in the nondecreasing order of d ij , the distance between i and

A note on linear resolution strategies i
A note on linear resolution strategies in consequence-finding
โœ Eliana Minicozzi; Raymond Reiter ๐Ÿ“‚ Article ๐Ÿ“… 1972 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 358 KB

The completeness, for consequence-finding, of various linear resolution strategies is siudied. Linear resolution with merging and subsL'mption is complete. A.ordered, linear resolution with merging J;ยข, in a certain sense, complete. Linear resolution with merging and C.ordering is incomplete. It is