An Interval Global Optimization Algorithm Combining Symbolic Rewriting and Componentwise Newton Method Applied to Control a Class of Queueing Systems

Author： Kubica Bartłomiej Malinowski Krzysztof

Publisher： Springer Publishing Company

ISSN： 1385-3139

Source： Reliable Computing, Vol.11, Iss.5, 2005-10, pp. : 393-411

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 fast memoryless interval-based algorithm for global optimization

By Sun M.

Journal of Global Optimization, Vol. 47, Iss. 2, 2010-06 ,pp. : 247-271

Springer Publishing Company

Access to resources Recommend Favorite

Multi-dimensional pruning from the Baumann point in an Interval Global Optimization Algorithm

By Tóth Boglárka Casado Leocadio

Journal of Global Optimization, Vol. 38, Iss. 2, 2007-06 ,pp. : 215-236

Springer Publishing Company

Access to resources Recommend Favorite

LARS: A learning algorithm for rewriting systems

By Eyraud Rémi

Machine Learning, Vol. 66, Iss. 1, 2007-01 ,pp. : 7-31

Springer Publishing Company

Access to resources Recommend Favorite

Errata and Opinion to: “An Interval Entropy Penalty Method for Nonlinear Global Optimization,”

By Kearfott R.

Reliable Computing, Vol. 11, Iss. 2, 2005-04 ,pp. : 163-164

Springer Publishing Company

Access to resources Recommend Favorite

Monotonicity Properties for Multi-Class Queueing Systems

By Verloop Ina Ayesta Urtzi Borst Sem

Discrete Event Dynamic Systems, Vol. 20, Iss. 4, 2010-12 ,pp. : 473-509

Springer Publishing Company

Access to resources Recommend Favorite