A genetic algorithm with interval fitness method for the minimum vertex cover problem

A tétel rövid nézete
dc.contributor.advisorNagy, Benedek
dc.contributor.authorSzokol, Péter
dc.contributor.departmentDE--TEK--Informatikai Karhu_HU
dc.date.accessioned2013-01-10T12:47:45Z
dc.date.available2013-01-10T12:47:45Z
dc.date.created2012
dc.date.issued2013-01-10T12:47:45Z
dc.description.abstractThis paper presents a new genetic algorithm for the minimum vertex cover problem. It uses interval valued fitness, greedy error correction to obtain phenotypes (candidate solutions). The interval valued fitness accelerates the search effectively at graphs with a lot of nodes and relatively small amount of edges. It is explained why we prefer to distinguish genotypes and phenotypes and do not use Lamarckian inheritance.hu_HU
dc.description.courseProgramtervező Informatikushu_HU
dc.description.degreeMschu_HU
dc.format.extent14hu_HU
dc.identifier.urihttp://hdl.handle.net/2437/156014
dc.language.isoenhu_HU
dc.subjectgenetikus algoritmushu_HU
dc.subjectminimális lefedő csúcshalmazhu_HU
dc.subject.dspaceDEENK Témalista::Informatikahu_HU
dc.titleA genetic algorithm with interval fitness method for the minimum vertex cover problemhu_HU
dc.title.translatedEgy genetikus algoritmus intervallumos fitnesz függvénnyel a minimális lefedő csúcshalmaz problémárahu_HU
Fájlok
Gyűjtemények
Hallgatói dolgozatok (Informatikai Kar)