Affine scheduling on bounded convex polyhedric domains is asymptotically optimal

Author： d'Argence P.L.G.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.196, Iss.1, 1998-04, pp. : 395-415

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Asymptotically optimal perfect steganographic systems

By Ryabko B.   Ryabko D.  

Problems of Information Transmission, Vol. 45, Iss. 2, 2009-06 ,pp. : 184-190

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

PERT scheduling with convex cost functions

By Chretienne P.   Sourd F.  

Theoretical Computer Science, Vol. 292, Iss. 1, 2003-01 ,pp. : 145-164

Elsevier

Access to resources Recommend Favorite

Asymptotically optimal control of parallel tandem queues with loss

By Sheu Ru-Shuo   Ziedins Ilze  

Queueing Systems, Vol. 65, Iss. 3, 2010-07 ,pp. : 211-227

Springer Publishing Company

Access to resources Recommend Favorite

Regret bounded by gradual variation for online convex optimization

By Yang Tianbao   Mahdavi Mehrdad   Jin Rong   Zhu Shenghuo  

Machine Learning, Vol. 95, Iss. 2, 2014-05 ,pp. : 183-223

Springer Publishing Company

Access to resources Recommend Favorite

Bounded Error Schemes for the Wave Equation on Complex Domains

By Abarbanel Saul   Ditkowski Adi   Yefet Amir  

Journal of Scientific Computing, Vol. 26, Iss. 1, 2006-01 ,pp. : 67-81

Springer Publishing Company

Access to resources Recommend Favorite