Sciweavers

675 search results - page 48 / 135
» Online stochastic optimization under time constraints
Sort
View
ESANN
2007
13 years 11 months ago
Kernel-based online machine learning and support vector reduction
We apply kernel-based machine learning methods to online learning situations, and look at the related requirement of reducing the complexity of the learnt classifier. Online meth...
Sumeet Agarwal, V. Vijaya Saradhi, Harish Karnick
INFOCOM
2012
IEEE
12 years 12 days ago
Delay optimal multichannel opportunistic access
Abstract—The problem of minimizing queueing delay of opportunistic access of multiple continuous time Markov channels is considered. A new access policy based on myopic sensing a...
Shiyao Chen, Lang Tong, Qing Zhao
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 8 months ago
Scheduling Periodic Real-Time Tasks with Heterogeneous Reward Requirements
—We study the problem of scheduling periodic real-time tasks which have individual minimum reward requirements. We consider situations where tasks generate jobs that can be provi...
I-Hong Hou, P. R. Kumar
COR
2008
112views more  COR 2008»
13 years 10 months ago
Buffer allocation in general single-server queueing networks
-- The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, integer mathematical programming problem. Moreover, the objective function, the ...
Frederico R. B. Cruz, A. R. Duarte, Tom Van Woense...
ICALP
2010
Springer
14 years 2 months ago
The Positive Semidefinite Grothendieck Problem with Rank Constraint
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
Jop Briët, Fernando Mário de Oliveira ...