z-logo
open-access-imgOpen Access
Finding all minimal elements of a finite partially ordered set by genetic algorithm with a prescribed probability
Author(s) -
Marcin Studniarski
Publication year - 2011
Publication title -
numerical algebra, control and optimization
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.303
H-Index - 20
eISSN - 2155-3289
pISSN - 2155-3297
DOI - 10.3934/naco.2011.1.389
Subject(s) - markov chain , genetic algorithm , set (abstract data type) , upper and lower bounds , mathematical optimization , finite set , mathematics , algorithm , order (exchange) , computer science , statistics , mathematical analysis , programming language , finance , economics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here