<?xml version="1.0" encoding="UTF-8"?><marc:collection xmlns:marc="http://www.loc.gov/MARC21/slim">
  <marc:record>
    <marc:leader>00000nam  2200000za 4500</marc:leader>
    <marc:controlfield tag="001">9.830208</marc:controlfield>
    <marc:controlfield tag="003">CaOODSP</marc:controlfield>
    <marc:controlfield tag="005">20240219183458</marc:controlfield>
    <marc:controlfield tag="007">cr |||||||||||</marc:controlfield>
    <marc:controlfield tag="008">170113s2014    oncd   |o    f|0| 0 eng d</marc:controlfield>
    <marc:datafield tag="040" ind1=" " ind2=" ">
      <marc:subfield code="a">CaOODSP</marc:subfield>
      <marc:subfield code="b">eng</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="043" ind1=" " ind2=" ">
      <marc:subfield code="a">n-cn---</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="086" ind1="1" ind2=" ">
      <marc:subfield code="a">D69-35/2014E-PDF</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="245" ind1="1" ind2="0">
      <marc:subfield code="a">Analysis of maritime air defence scenarios </marc:subfield>
      <marc:subfield code="h">[electronic resource] / </marc:subfield>
      <marc:subfield code="c">Bao Nguyen and Suruz Miah.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="260" ind1=" " ind2=" ">
      <marc:subfield code="a">[Ottawa] : </marc:subfield>
      <marc:subfield code="b">Defence Research and Development Canada, </marc:subfield>
      <marc:subfield code="c">[2014]</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="300" ind1=" " ind2=" ">
      <marc:subfield code="a">1 vol. (unnumbered) : </marc:subfield>
      <marc:subfield code="b">graphs.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="504" ind1=" " ind2=" ">
      <marc:subfield code="a">Includes bibliographic references.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="520" ind1="3" ind2=" ">
      <marc:subfield code="a">"In this paper, we examine scenarios of maritime air defence where the threats can be of different types i.e., characterized by varying different single shot probabilities of hit. We develop a methodology that integrates constrained optimization calculus, dynamic programming and a genetic algorithm to determine the optimal allocation of interceptors that globally maximize the probability of raid annihilation. We call this strategy the Heterogeneous tactic. We show that the improvement in the probability of raid annihilation could exceed thirty percent for one scenario examined, relative to a Shoot-Look-Shoot tactic with fixed size salvos"--Abstract.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="692" ind1="0" ind2="7">
      <marc:subfield code="2">gccst</marc:subfield>
      <marc:subfield code="a">Military technology</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="700" ind1="1" ind2=" ">
      <marc:subfield code="a">Miah, Suruz.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="710" ind1="2" ind2=" ">
      <marc:subfield code="a">Defence R&amp;D Canada.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="856" ind1="4" ind2="0">
      <marc:subfield code="q">PDF</marc:subfield>
      <marc:subfield code="s">213 KB</marc:subfield>
      <marc:subfield code="u">https://publications.gc.ca/collections/collection_2017/rddc-drdc/D69-35-2014-eng.pdf</marc:subfield>
    </marc:datafield>
  </marc:record>
</marc:collection>
