<?xml version="1.0" encoding="UTF-8"?>
<record
    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">

  <leader>01457nab a2200193   4500</leader>
  <controlfield tag="005">20260608201743.0</controlfield>
  <controlfield tag="008">260224s2013    xxu                 ing  </controlfield>
  <datafield tag="041" ind1=" " ind2=" ">
    <subfield code="a">Ingl&#xE9;s</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Feraille, M.</subfield>
    <subfield code="9">37945</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
    <subfield code="a">An Optimization Strategy Based on the Maximization of Matching-Targets' Probability for Unevaluated Results</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a"></subfield>
    <subfield code="b"></subfield>
    <subfield code="c">ene./feb. 2013</subfield>
  </datafield>
  <datafield tag="270" ind1=" " ind2=" ">
    <subfield code="a">25/10/2013 ; 25/10/2013</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">11 p. ; 545-556</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">Transcripci&#xF3;n del resumen del autor: The Maximization of Matching-Targets' Probability for Unevaluated Results (MMTPUR), technique presented in this paper, is based on the classical probabilistic optimization framework. The numerical function values that have not been evaluated are considered as stochastic functions. Thus, a Gaussian process uncertainty model is built for each required numerical function result (i.e., associated with each specified target) and is used to estimate probability density functions for unevaluated results. Parameter posterior distributions, used within the optimization process, then take into account these probabilities. This approach is particularly adapted when, getting one evaluation of the numerical function is very time consuming. In this paper, we provide a detailed outline of this technique. Finally, several test cases are developed to stress its potential.</subfield>
  </datafield>
  <datafield tag="581" ind1=" " ind2=" ">
    <subfield code="a">1</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="g"></subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">ARTICULO</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">187938</subfield>
    <subfield code="d">187938</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="9">255757</subfield>
    <subfield code="a">BAAB</subfield>
    <subfield code="b">BAAB</subfield>
    <subfield code="d">2026-03-06</subfield>
    <subfield code="j">200060092</subfield>
    <subfield code="l">0</subfield>
    <subfield code="p">200060092</subfield>
    <subfield code="r">2026-03-06 00:17:57</subfield>
    <subfield code="w">2026-03-06</subfield>
    <subfield code="y">ARTICULO</subfield>
  </datafield>
</record>
