1. Research with MATF
  2. MATF
  3. Research outputs
Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/3109
DC FieldValueLanguage
dc.contributor.authorKratica, Jozefen_US
dc.contributor.authorTošić, Dušanen_US
dc.contributor.authorFilipović, Vladimiren_US
dc.contributor.authorLjubić, Ivanaen_US
dc.date.accessioned2026-01-19T08:46:51Z-
dc.date.available2026-01-19T08:46:51Z-
dc.date.issued2000-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/3109-
dc.description.abstractA genetic algorithm (GA) is proposed for solving one continuous min-max global optimization problem arising from the synthesis of radar polyphase codes. GA implementation is successfully applied to this problem and it solves instances with n up to 20. Computational results are compared to other algorithms (implicit enumeration technique, Monte Carlo method and tabu search). In some cases, GA outperforms all of them.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.titleGenetic algorithm for designing a spread-spectrum radar polyphase codeen_US
dc.typeConference Objecten_US
dc.relation.conferenceOnline World Conference on Soft Computing in Industrial Applications (5 ; 2000)en_US
dc.relation.publication5th Online World Conference on Soft Computing in Industrial Applications WSC5en_US
dc.identifier.urlhttps://vladofilipovic.github.io/Science/Papers/A6.2-5.pdf-
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.isbn951-22-5205-8en_US
dc.description.rankM33en_US
dc.relation.firstpage191en_US
dc.relation.lastpage197en_US
item.openairetypeConference Object-
item.cerifentitytypePublications-
item.languageiso639-1en-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.orcid0000-0002-5943-8037-
Appears in Collections:Research outputs
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.