Sciweavers

454 search results - page 48 / 91
» The Capacity Allocation Paradox
Sort
View
WSC
2001
13 years 11 months ago
Production scheduling validity in high level supply chain models
Although they focus on the big picture, high level supply chain models cannot gloss over the capacity of production nodes to meet production allocations. Capacity is not simply a ...
David J. Parsons, Richard A. Phelps
PE
1998
Springer
104views Optimization» more  PE 1998»
13 years 9 months ago
Analysis of Transient of the Datagram Traffic for a Demand Assignment TDMA
- A modified version of the datagram capacity assignment of the FODA access scheme, named FODA/IBEA, is briefly presented. The main difference from the previous version (besides th...
Nedo Celandroni
WIOPT
2010
IEEE
13 years 8 months ago
Throughput-delay-reliability tradeoff in ad hoc networks
Abstract—Delay-reliability (D-R), and throughput-delayreliability (T-D-R) tradeoffs in an ad hoc network are derived for single hop and multi-hop transmission with automatic repe...
Rahul Vaze
GLOBECOM
2006
IEEE
14 years 4 months ago
Sum Rate Maximization and Transmit Power Minimization for Multi-User Orthogonal Space Division Multiplexing
—We demonstrate that receive antenna selection (RAS) provides significant increase in the achievable sum rates for multi-user MIMO wireless downlinks that employ block diagonaliz...
Boon Chin Lim, Christian Schlegel, Witold A. Krzym...
DAM
2006
132views more  DAM 2006»
13 years 10 months ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler