Sciweavers

14165 search results - page 684 / 2833
» The generalized two-server problem
Sort
View
DISOPT
2008
99views more  DISOPT 2008»
15 years 7 months ago
Computing robust basestock levels
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...
Daniel Bienstock, Nuri Özbay
DM
2008
61views more  DM 2008»
15 years 7 months ago
Wilf classification of three and four letter signed patterns
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
CORR
2006
Springer
112views Education» more  CORR 2006»
15 years 7 months ago
Joint universal lossy coding and identification of i.i.d. vector sources
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...
Maxim Raginsky
DM
2006
104views more  DM 2006»
15 years 7 months ago
Construction of trees and graphs with equal domination parameters
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...
DCG
2007
104views more  DCG 2007»
15 years 7 months ago
Coincidence Site Modules in 3-Space
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, ...
Michael Baake, Peter A. B. Pleasants, Ulf Rehmann