A NOTE ON THE MAXIMUM MISSED-OPPORTUNITY COST INCURRED BY MINIMIZING EXPECTED LOSSES IN GENETIC ALGORITHMS

Author： Fogel David B.  

Publisher： Taylor & Francis Ltd

ISSN： 1087-6553

Source： Cybernetics and Systems, Vol.30, Iss.3, 1999-04, pp. : 205-211

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

Generalization of EDF and LLF: Identifying All Optimal Online Algorithms for Minimizing Maximum Lateness

By Uthaisombut Patchrawat  

Algorithmica, Vol. 50, Iss. 3, 2008-03 ,pp. : 312-328

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms for Minimizing Response Time in Broadcast Scheduling

By Gandhi Rajiv   Khuller Samir   Kim Yoo-Ah   Wan Yung-Chun (Justin)  

Algorithmica, Vol. 38, Iss. 4, 2004-01 ,pp. : 597-608

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings

By Hong Seok-Hee   Nagamochi Hiroshi  

Algorithmica, Vol. 58, Iss. 2, 2010-10 ,pp. : 478-497

Springer Publishing Company

Access to resources Recommend Favorite

Recurrent Algorithms for Selecting the Maximum Input

By Koutroumbas Konstantinos  

Neural Processing Letters, Vol. 20, Iss. 3, 2004-11 ,pp. : 179-197

Springer Publishing Company

Access to resources Recommend Favorite

On the cost of uniform and nonuniform algorithms

By Novak E.   Wozniakowski H.  

Theoretical Computer Science, Vol. 219, Iss. 1, 1999-05 ,pp. : 301-318

Elsevier

Access to resources Recommend Favorite