We consider a loss model of an unbuffered resource having C channels, which are shared by several different types of service connections.
We consider a loss model of an unbuffered resource having C channels, which are shared by several different types of service connections.
We consider an unbuffered resource having capacity C, which is shared by several different services.
We evaluate the asymptotic normalized average distributions of a class of combinatorial configurations in random, regular and irregular, binary low-density parity-check (LDPC) code ensembles.
We present two decomposition approximations for open single class queueing networks with a single bottleneck station which are asymptotically exact in both light and heavy traffic.
Using algebraic geometry codes we give a polynomial construction of quantum codes with asymptotically non-zero rate and relative distance.
A dynamic pricing problem that arises in a revenue management context is considered, involving several resources and several demand classes, each of which uses a particular subset of the resources.
Optimizing multi-product assemble-to-order (ATO) inventory systems is a long-standing difficult problem.
Recent results have demonstrated the enormous capacity potential of wireless communication schemes employing multiple transmit and receive antennas, in particular when the transfer functions betwee
Dirichlet distribution and multinomial distribution play important role in information theory and statistics.
