untitled
<OAI-PMH schemaLocation=http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd>
<responseDate>2018-01-15T18:42:43Z</responseDate>
<request identifier=oai:HAL:hal-00602267v1 verb=GetRecord metadataPrefix=oai_dc>http://api.archives-ouvertes.fr/oai/hal/</request>
<GetRecord>
<record>
<header>
<identifier>oai:HAL:hal-00602267v1</identifier>
<datestamp>2017-12-21</datestamp>
<setSpec>type:ART</setSpec>
<setSpec>subject:info</setSpec>
<setSpec>collection:UNIV-AG</setSpec>
<setSpec>collection:BNRMI</setSpec>
</header>
<metadata><dc>
<publisher>HAL CCSD</publisher>
<title lang=fr>Coopération inter-couche dans un algorithme hybride Illustration avec l'optimisation de constellations de satellites</title>
<creator>Grandchamp, Enguerran</creator>
<contributor>Laboratoire de Mathématiques Informatique et Applications (LAMIA) ; Université des Antilles et de la Guyane (UAG)</contributor>
<description>International audience</description>
<source>Journal Européen des Systèmes Avancés</source>
<identifier>hal-00602267</identifier>
<identifier>https://hal.archives-ouvertes.fr/hal-00602267</identifier>
<source>https://hal.archives-ouvertes.fr/hal-00602267</source>
<source>Journal Européen des Systèmes Avancés, 2005, pp.1</source>
<language>fr</language>
<subject lang=fr>optimisation hybride</subject>
<subject lang=fr>meta-heuristique</subject>
<subject lang=fr>recherche taboue</subject>
<subject lang=fr>ensemble ou</subject>
<subject>[INFO.INFO-TI] Computer Science [cs]/Image Processing</subject>
<type>info:eu-repo/semantics/article</type>
<type>Journal articles</type>
<description lang=en>This paper deals with hybrid optimization take different methods to solve a complex problem. As if the choice of concerning methods is important, the way to combine them is determinant for an ef cient search. The article deals with cooperation strategy between the different layers of an hybrid optimization algorithm. We describ the way it is articulated for an Satellite Constellation Optimization problem. This cooperation allows a dynamical adaptation of the optimization algorithm parameters according to the mutual advance of each search</description>
<date>2005-12-01</date>
</dc>
</metadata>
</record>
</GetRecord>
</OAI-PMH>
