Increasing parallelism of evolutionary algorithms by Nash games in design inverse flow problems

Author： Leskinen Jyri   Wang Hong   Périaux Jacques  

Publisher： Emerald Group Publishing Ltd

ISSN： 0264-4401

Source： Engineering Computations: Int J for Computer-Aided Engineering, Vol.30, Iss.4, 2013-05, pp. : 581-600

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

Efficient algorithms for linear dynamic inverse problems with known motion

By Hahn B N  

Inverse Problems, Vol. 30, Iss. 3, 2014-03 ,pp. : 35008-35027

IOP Publishing

Access to resources Recommend Favorite

Randomized algorithms for large-scale inverse problems with general Tikhonov regularizations

By  

Inverse Problems, Vol. 31, Iss. 8, 2015-01 ,pp. : 85008-85031

IOP Publishing

Access to resources Recommend Favorite

Solving the inverse Stefan design problem using genetic algorithms

By Słota Damian  

Inverse Problems in Science and Engineering, Vol. 16, Iss. 7, 2008-10 ,pp. : 829-846

Taylor & Francis Ltd

Access to resources Recommend Favorite

Solving the inverse Stefan design problem using genetic algorithms

By Slota Damian  

Inverse Problems in Science and Engineering, Vol. 16, Iss. 8, 2008-12 ,pp. : 1069-1070

Taylor & Francis Ltd

Access to resources Recommend Favorite

Design of an extended unknown input observer with stochastic robustness techniques and evolutionary algorithms

By  

International Journal of Control, Vol. 80, Iss. 5, 2007-05 ,pp. : 749-762

Taylor & Francis Ltd

Access to resources Recommend Favorite