Sciweavers

247 search results - page 10 / 50
» Optimal Preemptive Scheduling for General Target Functions
Sort
View
BMCBI
2010
116views more  BMCBI 2010»
13 years 7 months ago
Optimization algorithms for functional deimmunization of therapeutic proteins
Background: To develop protein therapeutics from exogenous sources, it is necessary to mitigate the risks of eliciting an anti-biotherapeutic immune response. A key aspect of the ...
Andrew S. Parker, Wei Zheng, Karl E. Griswold, Chr...
GECCO
2007
Springer
236views Optimization» more  GECCO 2007»
14 years 1 months ago
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
Quan-Qe Pan, Mehmet Fatih Tasgetiren, Yun-Chia Lia...
WIOPT
2011
IEEE
12 years 11 months ago
Network utility maximization over partially observable Markovian channels
Abstract—This paper considers maximizing throughput utility in a multi-user network with partially observable Markov ON/OFF channels. Instantaneous channel states are never known...
Chih-Ping Li, Michael J. Neely
COMPSAC
2004
IEEE
13 years 11 months ago
Adaptive Time-Critical Resource Management Using Time/Utility Functions: Past, Present, and Future
Time/utility function time constraints (or TUFs) and utility accrual (UA) scheduling optimality criteria, constitute, arguably, the most effective and broadest approach for adapti...
Peng Li, Binoy Ravindran, E. Douglas Jensen
INFOCOM
2006
IEEE
14 years 1 months ago
Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
Michael J. Neely