<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>DSpace Coleção:</title>
    <link>http://repositorio.ufc.br/handle/riufc/72</link>
    <description />
    <pubDate>Tue, 07 Apr 2026 13:17:34 GMT</pubDate>
    <dc:date>2026-04-07T13:17:34Z</dc:date>
    <item>
      <title>On Cost based algorithm selection for problem solving</title>
      <link>http://repositorio.ufc.br/handle/riufc/41789</link>
      <description>Título: On Cost based algorithm selection for problem solving
Autor(es): Arruda, Edilson Fernandes de; Ourique, Fabrício de Oliveira; Almudevar, Anthony
Editor(es): American Journal of Operations Research
Abstract: This work proposes a novel framework that enables one to compare distinct iterative procedures with known rates of convergence, in terms of the computational effort to be employed to reach some prescribed vicinity of the optimal solution to a given problem of interest. An algorithm is introduced that decides between two competing algorithms, which algorithm makes the best use of the computational resources for some prescribed error. Several examples are presented that illustrate the trade-offs involved in such a choice and demonstrate that choosing an algorithm over another with a higher rate of convergence can be perfectly justifiable in terms of the overall computational effort.
Tipo: Artigo de Periódico</description>
      <pubDate>Tue, 01 Jan 2013 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://repositorio.ufc.br/handle/riufc/41789</guid>
      <dc:date>2013-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Reducción de modelos en la presencia de parámetros de perturbación</title>
      <link>http://repositorio.ufc.br/handle/riufc/41786</link>
      <description>Título: Reducción de modelos en la presencia de parámetros de perturbación
Autor(es): Farias, Rafael Bráz Azevedo; Arenas, German Moreno; Patriota, Alexandre Galvão
Tipo: Artigo de Periódico</description>
      <pubDate>Thu, 01 Jan 2009 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://repositorio.ufc.br/handle/riufc/41786</guid>
      <dc:date>2009-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>On the Harris-G class of distributions: General results and application</title>
      <link>http://repositorio.ufc.br/handle/riufc/41778</link>
      <description>Título: On the Harris-G class of distributions: General results and application
Autor(es): Pinho, Luis Gustavo Bastos; Cordeiro, Gauss Moutinho; Nobre, Juvêncio Santos
Abstract: We investigate some properties of the Harris-G class of distributions (Sankhya B 73 (2011) 70–80). We demonstrate that the density function of the Harris-G class can be expressed as a linear combination of density functions of the exponentiated baseline distribution. We provide general formulas for moments (raw, centered, incomplete and factorial), quantile function, generating functions and entropies. Two numerical examples are presented to demonstrate the potentiality of the models in this class. The first&#xD;
one applies the Harris–Burr XII distribution to model bimodal data. The second example uses the Harris-exponential distribution to model SAR image data. The results of the fitted models look promising.
Tipo: Artigo de Periódico</description>
      <pubDate>Thu, 01 Jan 2015 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://repositorio.ufc.br/handle/riufc/41778</guid>
      <dc:date>2015-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Um Algoritmo polinomial para o problema de empacotamento de contêineres com estabilidade estática da carga</title>
      <link>http://repositorio.ufc.br/handle/riufc/41773</link>
      <description>Título: Um Algoritmo polinomial para o problema de empacotamento de contêineres com estabilidade estática da carga
Autor(es): Silva, José Lassance de Castro; Soma, Nei Yoshihiro
Abstract: A polynomial computational bounded resouces heuristic for the Three-Dimensional Bin Packing problem (3D-BPP) is suggested. The major contribution is the introduction of static stability of the packing and the criteria used for such a packing are described in details. The filling process follows the well known 3-D corner approach. The problem is NP-Hard in the strong sense and extremely difficult to be solved in the practice. Extensive computational experiments are also presented, with instances up to 90 items, with and without static stability. The results are compared with those obtained from the literature.
Tipo: Artigo de Periódico</description>
      <pubDate>Wed, 01 Jan 2003 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://repositorio.ufc.br/handle/riufc/41773</guid>
      <dc:date>2003-01-01T00:00:00Z</dc:date>
    </item>
  </channel>
</rss>

