An Upper Bound on the Loss from Approximate Optimal-Value Functions

ISSN： 0885-6125

Source： Machine Learning, Vol.16, Iss.3, 1994-09, pp. : 227-233

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

A Rigorous Lower Bound for the Optimal Value of Convex Optimization Problems

By Jansson Christian

Journal of Global Optimization, Vol. 28, Iss. 1, 2004-01 ,pp. : 121-137

Springer Publishing Company

Access to resources Recommend Favorite

Cartesian authentication codes from functions with optimal nonlinearity

By Chanson S. Ding C. Salomaa A.

Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. : 1737-1752

Elsevier

Access to resources Recommend Favorite

Adding upper-bound pruning to IDA*

By Prieditis Armand

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 9, Iss. 1, 1997-01 ,pp. : 67-81

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the calculation of the stability radiusof an optimal or an approximate schedule

By Sotskov Y.N. Wagelmans A.P.M. Werner F.

Annals of Operations Research, Vol. 83, Iss. 1, 1998-01 ,pp. : 213-252

Springer Publishing Company

Access to resources Recommend Favorite

Improvement and estimation of the approximate optimal positional control

By Nikiforova L. Ukhin M.

Automation and Remote Control, Vol. 68, Iss. 2, 2007-02 ,pp. : 245-253

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite