<?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>00000ctmaa22000003a 4500</leader>
  <controlfield tag="001">UP-1685675941123923273</controlfield>
  <controlfield tag="003">Buklod</controlfield>
  <controlfield tag="005">20151012150946.0</controlfield>
  <controlfield tag="006">aa    rb   |||1 u|</controlfield>
  <controlfield tag="007">ta</controlfield>
  <controlfield tag="008">151012s        xx     d     r    |||| u|</controlfield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(iLib)UPTAC-00017720380</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
   <subfield code="a">UPVTC</subfield>
  </datafield>
  <datafield tag="041" ind1="0" ind2=" ">
   <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="090" ind1=" " ind2="0">
   <subfield code="a">LG 993.5 2011 C66</subfield>
   <subfield code="b">D37</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Daria, Airene Louise B.</subfield>
   <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Queen bees</subfield>
   <subfield code="b">solving N-Queens problem using ABC algorithm</subfield>
   <subfield code="c">Airene Louise B. Daria; John Paul T. Yusiong, adviser.</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
   <subfield code="c">2011.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
   <subfield code="a">[4], 58 leaves</subfield>
   <subfield code="b">illustrations.</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
   <subfield code="a">Undergraduate thesis (B.S. Computer Science) -- University of the Philippines, Tacloban.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
   <subfield code="a">The N-Queens problem has been present for over a century and had caught the attention of several mathematicians, game enthusiasts and computer scientists. The problem aims in placing N queens in an N by N board where no two or more queens attack each other as governed by the rules in the famous board game chess. Another swarm based intelligence algorithm which mimics the intelligent behavior of bees in food foraging is used in coming up with a single solution from a family of solutions given a certain number N. In this study, an implementation of the Artificial Bee Colony algorithm is presented to solve the N-Queens problem. The results then showed the effectiveness of the algorithm in solving the N-queens problem with values for N ranging from 4 to 1000.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">N-Queens.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Swarm Based Intelligence.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Artificial Bee Colony Algorithm.</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Yusiong, John Paul T.</subfield>
   <subfield code="e">adviser.</subfield>
  </datafield>
  <datafield tag="905" ind1=" " ind2=" ">
   <subfield code="a">FI</subfield>
  </datafield>
  <datafield tag="905" ind1=" " ind2=" ">
   <subfield code="a">UP</subfield>
  </datafield>
  <datafield tag="852" ind1="0" ind2=" ">
   <subfield code="a">UPTAC</subfield>
   <subfield code="b">UPTAC</subfield>
   <subfield code="h">LG 993.5 2011 C66</subfield>
   <subfield code="i">D37</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
   <subfield code="a">Thesis</subfield>
  </datafield>
 </record>
</collection>
