<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd" xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>00000cmm a22000004a 4500</leader>
  <controlfield tag="001">UP-99796217611212027</controlfield>
  <controlfield tag="003">Buklod</controlfield>
  <controlfield tag="005">20140423145211.0</controlfield>
  <controlfield tag="006">m    go  j        </controlfield>
  <controlfield tag="007">cr cn |||aaaaa</controlfield>
  <controlfield tag="008">110713s2011    xx         u |      eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
   <subfield code="a">9783642220845 (eBook)</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
   <subfield code="a">3642220843 (eBook)</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(iLib)UPD-00214608175</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
   <subfield code="a">DLC</subfield>
   <subfield code="d">DML</subfield>
  </datafield>
  <datafield tag="041" ind1="0" ind2=" ">
   <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="042" ind1=" " ind2=" ">
   <subfield code="a">DMLUC</subfield>
  </datafield>
  <datafield tag="084" ind1=" " ind2=" ">
   <subfield code="a">QA 402.5</subfield>
   <subfield code="b">L87 2011eb</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Luque, Gabriel</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Parallel genetic algorithms</subfield>
   <subfield code="h">[electronic resource]</subfield>
   <subfield code="b">theory and real world applications</subfield>
   <subfield code="c">Gabriel Luque and Enrique Alba.</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
   <subfield code="a">Berlin</subfield>
   <subfield code="b">Springer-Verlag</subfield>
   <subfield code="c">c2011.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
   <subfield code="a">1 online resource (xii, 171 p.)</subfield>
   <subfield code="b">ill.</subfield>
  </datafield>
  <datafield tag="490" ind1="0" ind2=" ">
   <subfield code="a">Studies in Computational Intelligence</subfield>
   <subfield code="v">367</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2=" ">
   <subfield code="a">Part I Introduction -- Part II Characterization of Parallel Genetic Algorithms -- Part III Applications of Parallel Genetic Algorithms.</subfield>
  </datafield>
  <datafield tag="506" ind1=" " ind2=" ">
   <subfield code="a">IP-based subscription, access limited to within on-campus computer network.</subfield>
   <subfield code="c">Access via Electronic Resources of the UPD University Library Website.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
   <subfield code="a">This book is the result of several years of research trying to better characterize parallel genetic algorithms (pGAs) as a powerful tool for optimization, search, and learning. Readers can learn how to solve complex tasks by reducing their high computational times. Dealing with two scientific fields (parallelism and GAs) is always difficult, and the book seeks at gracefully introducing from basic concepts to advanced topics.   The presentation is structured in three parts. The first one is targeted to the algorithms themselves, discussing their components, the physical parallelism, and best practices in using and evaluating them. A second part deals with the theory for pGAs, with an eye on theory-to-practice issues. A final third part offers a very wide study of pGAs as practical problem solvers, addressing domains such as natural language processing, circuits design, scheduling, and genomics.   This volume will be helpful both for researchers and practitioners. The first part shows pGAs to either beginners and mature researchers looking for a unified view of the two fields: GAs and parallelism. The second part partially solves (and also opens) new investigation lines in theory of pGAs. The third part can be accessed independently for readers interested in applications. The result is an excellent source of information on the state of the art and future developments in parallel GAs.  </subfield>
  </datafield>
  <datafield tag="533" ind1=" " ind2=" ">
   <subfield code="a">Electronic reproduction.</subfield>
   <subfield code="b">New York</subfield>
   <subfield code="c">SpringerLink</subfield>
   <subfield code="d">2011.</subfield>
   <subfield code="n">Available via World Wide Web through SpringerLink.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Genetic algorithms.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Artificial intelligence.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Electronic books.</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Alba, Enrique.</subfield>
  </datafield>
  <datafield tag="710" ind1="2" ind2=" ">
   <subfield code="a">SpringerLink (Online service).</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="y">Available for University of the Philippines Diliman via SpringerLink. Click here to access</subfield>
   <subfield code="u">http://link.springer.com/book/10.1007/978-3-642-22084-5</subfield>
  </datafield>
  <datafield tag="905" ind1=" " ind2=" ">
   <subfield code="a">FO</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="a">Monograph</subfield>
  </datafield>
  <datafield tag="852" ind1="0" ind2=" ">
   <subfield code="a">UPD</subfield>
   <subfield code="b">DMLR</subfield>
  </datafield>
  <datafield tag="852" ind1="0" ind2=" ">
   <subfield code="a">UPD</subfield>
   <subfield code="b">DSCI</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
   <subfield code="a">Electronic Resource</subfield>
  </datafield>
 </record>
</collection>
