This paper considers how to optimally set the basestock level for a single buffer when demand is uncertain, in a robust framework. We present a family of algorithms based on decom...
We give some new Wilf equivalences for signed patterns which allow the complete classification of signed patterns of lengths three and four. The problem is considered for pattern a...
W. M. B. Dukes, Toufik Mansour, Astrid Reifegerste
The problem of joint universal source coding and modeling, addressed by Rissanen in the context of lossless codes, is generalized to fixed-rate lossy coding of continuousalphabet m...
We provide a simple constructive characterization for trees with equal domination and independent domination numbers, and for trees with equal domination and total domination numb...
Michael Dorfling, Wayne Goddard, Michael A. Hennin...
The coincidence site lattice (CSL) problem and its generalization to Z-modules in Euclidean 3-space is revisited, and various results and conjectures are proved in a unified way, ...