Sciweavers

658 search results - page 132 / 132
» Lower bounds for sorting networks
Sort
View
TWC
2008
99views more  TWC 2008»
13 years 7 months ago
Robust transmit processing for frequency-selective fading channels with imperfect channel feedback
Reliable channel state information at the transmitter (CSIT) can improve the throughput of wireless networks significantly. In a realistic scenario, there is a mismatch between th...
Christof Jonietz, Wolfgang H. Gerstacker, Robert S...
CN
2002
117views more  CN 2002»
13 years 7 months ago
Achieving differentiated services through multi-class probabilistic priority scheduling
Differentiated Services (DiffServ) is a promising architecture for the next generation Internet due to its scalable and flexible design. In DiffServ, scheduling disciplines play an...
Chen-Khong Tham, Qi Yao, Yuming Jiang
MP
2002
85views more  MP 2002»
13 years 7 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman