<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     naa a22        4500</leader>
  <controlfield tag="001">510809596</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180411083436.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">180411e20130101xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1134/S1064230712060056</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1134/S1064230712060056</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">VLSI floorplanning based on the integration of adaptive search models</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[V. Kureichik, B. Lebedev, V. Lebedev]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">A hybrid approach and methods for representing the VLSI floorplanning problem in the form of evolutionary processes based on the integration of adaptive behavior models of biological systems and on composite architectures of solution algorithms are described. This makes it possible to deal with large-scale problems and obtain high-quality results in reasonable time. The floorplan synthesis includes two phases. In the first phase, the cut tree is produced using the genetic techniques; in the second phase, the floorplan is formed using the convolution by the methods of collective adaptation of the tree cut. Variants of circuits with the variable module orientation of fixed or stochastic size are considered. The probability of obtaining an optimal solution is 0.9, and the average deviation of the solutions from the optimal ones is 1%.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Pleiades Publishing, Ltd., 2013</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Kureichik</subfield>
   <subfield code="D">V.</subfield>
   <subfield code="u">Taganrog Institute of Technology, Southern Federal University, Nekrasovskii per. 44, GSP-17A, 347928, Taganrog, Russia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Lebedev</subfield>
   <subfield code="D">B.</subfield>
   <subfield code="u">Taganrog Institute of Technology, Southern Federal University, Nekrasovskii per. 44, GSP-17A, 347928, Taganrog, Russia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Lebedev</subfield>
   <subfield code="D">V.</subfield>
   <subfield code="u">Taganrog Institute of Technology, Southern Federal University, Nekrasovskii per. 44, GSP-17A, 347928, Taganrog, Russia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Journal of Computer and Systems Sciences International</subfield>
   <subfield code="d">SP MAIK Nauka/Interperiodica</subfield>
   <subfield code="g">52/1(2013-01-01), 80-96</subfield>
   <subfield code="x">1064-2307</subfield>
   <subfield code="q">52:1&lt;80</subfield>
   <subfield code="1">2013</subfield>
   <subfield code="2">52</subfield>
   <subfield code="o">11488</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1134/S1064230712060056</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1134/S1064230712060056</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Kureichik</subfield>
   <subfield code="D">V.</subfield>
   <subfield code="u">Taganrog Institute of Technology, Southern Federal University, Nekrasovskii per. 44, GSP-17A, 347928, Taganrog, Russia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Lebedev</subfield>
   <subfield code="D">B.</subfield>
   <subfield code="u">Taganrog Institute of Technology, Southern Federal University, Nekrasovskii per. 44, GSP-17A, 347928, Taganrog, Russia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Lebedev</subfield>
   <subfield code="D">V.</subfield>
   <subfield code="u">Taganrog Institute of Technology, Southern Federal University, Nekrasovskii per. 44, GSP-17A, 347928, Taganrog, Russia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Journal of Computer and Systems Sciences International</subfield>
   <subfield code="d">SP MAIK Nauka/Interperiodica</subfield>
   <subfield code="g">52/1(2013-01-01), 80-96</subfield>
   <subfield code="x">1064-2307</subfield>
   <subfield code="q">52:1&lt;80</subfield>
   <subfield code="1">2013</subfield>
   <subfield code="2">52</subfield>
   <subfield code="o">11488</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
