Sciweavers

5757 search results - page 854 / 1152
» Dynamic Policy Programming
Sort
View
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
15 years 7 months ago
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
Nikhil Bansal, Kedar Dhamdhere, Jochen Könema...
TON
2002
112views more  TON 2002»
15 years 6 months ago
Pricing in multiservice loss networks: static pricing, asymptotic optimality, and demand substitution effects
We consider a communication network with fixed routing that can accommodate multiple service classes, differing in bandwidth requirements, demand pattern, call duration, and routin...
Ioannis Ch. Paschalidis, Yong Liu
RTS
2008
119views more  RTS 2008»
15 years 6 months ago
Symbolic quality control for multimedia applications
We present a fine grain quality control method for multimedia applications. The method takes as input an application software composed of actions. The execution times of actions a...
Jacques Combaz, Jean-Claude Fernandez, Joseph Sifa...
INFOCOM
2010
IEEE
15 years 5 months ago
Maximum Damage Malware Attack in Mobile Wireless Networks
—Malware attacks constitute a serious security risk that threatens to slow down the large scale proliferation of wireless applications. As a first step towards thwarting this se...
M. H. R. Khouzani, Saswati Sarkar, Eitan Altman
JSAC
2010
101views more  JSAC 2010»
15 years 5 months ago
Shortest propagation delay (SPD) first scheduling for EPONs with heterogeneous propagation delays
—Due to the geographic distribution of its subscribers, Ethernet Passive Optical Networks (EPONs) have typically varying propagation delays between the Optical Network Units (ONU...
Michael P. McGarry, Martin Reisslein, Frank Aurzad...