𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Entropy Minimization with Lattice Bounds

✍ Scribed by J.M. Borwein; A.S. Lewis; M.A. Limber

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
420 KB
Volume
79
Category
Article
ISSN
0021-9045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Entropy Bounds for Gibbs Measures with N
Entropy Bounds for Gibbs Measures with Non-Gaussian Tails
✍ BogusΕ‚aw ZegarliΕ„ski πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 209 KB

to dan stroock on the occasion of his 60th birthday We introduce and study relative entropy bounds which (under some mixing conditions) allow us to classify the distribution tails in the infinite dimensional setting.

Bounded distributive lattices with stric
Bounded distributive lattices with strict implication
✍ Sergio Celani; Ramon Jansana πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 384 KB

The present paper introduces and studies the variety WH of weakly Heyting algebras. It corresponds to the strict implication fragment of the normal modal logic K which is also known as the subintuitionistic local consequence of the class of all Kripke models. The tools developed in the paper can be

Minimal Adaptive Routing on the Mesh wit
Minimal Adaptive Routing on the Mesh with Bounded Queue Size
✍ Donald D. Chinn; Tom Leighton; Martin Tompa πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 388 KB

An adaptive routing algorithm is one in which the path a packet takes from its source to its destination may depend on other packets it encounters. Such algorithms potentially avoid network bottlenecks by routing packets around ''hot spots.'' Minimal adaptive routing algorithms have the additional a

Lower bounds and algorithms for flowtime
Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
✍ Simon Dunstall; Andrew Wirth; Kenneth Baker πŸ“‚ Article πŸ“… 2000 πŸ› Springer US 🌐 English βš– 165 KB πŸ‘ 3 views

We consider the scheduling of N jobs divided into G families for processing on a single machine. No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i = j, the duration of this