Research articles A comparison between zero and first order approximation algorithms for layered manufacturing

Author： Jager P.J. de   Broek J.J.   Vergeest J.S.M.  

Publisher： Emerald Group Publishing Ltd

ISSN： 0144-5154

Source： Assembly Automation, Vol.17, Iss.3, 1997-03, pp. : 233-238

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

Approximation of the solution for a class of first order p.d.e. by Adomian method

By Khelifa S   Cherruault Y  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 31, Iss. 3-4, 2002-07 ,pp. : 577-595

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

First and Second Order SMO Algorithms for LS-SVM Classifiers

By López Jorge  

Neural Processing Letters, Vol. 33, Iss. 1, 2011-02 ,pp. : 31-44

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for Broadcasting and Gossiping

By Fraigniaud P.   Vial S.  

Journal of Parallel and Distributed Computing, Vol. 43, Iss. 1, 1997-05 ,pp. : 47-55

Academic Press

Access to resources Recommend Favorite

Approximation Algorithms for Scheduling with Reservations

By Diedrich Florian   Jansen Klaus   Pascual Fanny   Trystram Denis  

Algorithmica, Vol. 58, Iss. 2, 2010-10 ,pp. : 391-404

Springer Publishing Company

Access to resources Recommend Favorite

A comparison between genetic algorithms and the RAND method for solving the joint replenishment problem

By Khouja M.   Michalewicz Z.   Satoskar S. S.  

Production Planning and Control, Vol. 11, Iss. 6, 2000-09 ,pp. : 556-564

Taylor & Francis Ltd

Access to resources Recommend Favorite