Continuous-Review Tracking Policies for Dynamic Control of Stochastic Networks
Queueing Systems: Theory and Applications
A Topic-Specific Web Robot Model Based on Restless Bandits
IEEE Internet Computing
Stochastic Networks: Admission and Routing Using Penalty Functions
Queueing Systems: Theory and Applications
Adaptive nonlinear congestion controller for a differentiated-services framework
IEEE/ACM Transactions on Networking (TON)
Mathematics of Operations Research
Approximation algorithms for restless bandit problems
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A Generalized Gittins Index for a Class of Multiarmed Bandits with General Resource Requirements
Mathematics of Operations Research
IEEE Transactions on Wireless Communications
Optimality of myopic sensing in multichannel opportunistic access
IEEE Transactions on Information Theory
A mean field approach for optimization in particle systems and applications
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Grid brokering for batch allocation using indexes
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Adaptive congestion control under dynamic weather condition for wireless and satellite networks
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
The stochastic machine replenishment problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Multi-channel opportunistic access: a case of restless bandits with multiple plays
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Dynamic multichannel access with imperfect channel state detection
IEEE Transactions on Signal Processing
A fluid approach to large volume job shop scheduling
Journal of Scheduling
A modeling framework for optimizing the flow-level scheduling with time-varying channels
Performance Evaluation
Approximation algorithms for restless bandit problems
Journal of the ACM (JACM)
IEEE Transactions on Information Theory
A mean field approach for optimization in discrete time
Discrete Event Dynamic Systems
Algorithms and mechanisms for procuring services with uncertain durations using redundancy
Artificial Intelligence
Using emotions to enhance decision-making
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Artificial Life
| Hi-index | 0.12 |
We show that several well-known optimization problems related to the optimal control of queues are provably intractable-independently of any unproven conjecture such as P (not equal) NP. In particular, we show that several versions of the problem of optimally controlling a simple network of queues with simple arrival and service distributions and multiple customer classes is complete for exponential time. This is perhaps the first such intractability result for a well-known optimization problem. We also show that the restless bandit problem (the generalization of the multi-armed bandit problem to the case in which the unselected processes are not quiescent) is complete for polynomial space.