<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>DSpace Coleção:</title>
  <link rel="alternate" href="https://repositorio.ufms.br/handle/123456789/6784" />
  <subtitle />
  <id>https://repositorio.ufms.br/handle/123456789/6784</id>
  <updated>2026-04-13T06:40:08Z</updated>
  <dc:date>2026-04-13T06:40:08Z</dc:date>
  <entry>
    <title>Elaboração de documentação do projeto Sistema de Patrimônios FACOM</title>
    <link rel="alternate" href="https://repositorio.ufms.br/handle/123456789/14100" />
    <author>
      <name />
    </author>
    <id>https://repositorio.ufms.br/handle/123456789/14100</id>
    <updated>2025-12-10T12:48:34Z</updated>
    <published>2025-01-01T00:00:00Z</published>
    <summary type="text">Título: Elaboração de documentação do projeto Sistema de Patrimônios FACOM
Abstract: O Sistema de Gestão Patrimonial FACOM/UFMS é uma aplicação web completa desenvolvida para o registro, controle e gerenciamento de bens patrimoniais da Faculdade de Computação da Universidade Federal de Mato Grosso do Sul (FACOM/UFMS).
Tipo: Manual</summary>
    <dc:date>2025-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Porcentagens de particionamento do relax and fix e nova proposta de PLI para o problema da filogenia viva com politomia</title>
    <link rel="alternate" href="https://repositorio.ufms.br/handle/123456789/14060" />
    <author>
      <name />
    </author>
    <id>https://repositorio.ufms.br/handle/123456789/14060</id>
    <updated>2025-12-09T16:45:00Z</updated>
    <published>2025-01-01T00:00:00Z</published>
    <summary type="text">Título: Porcentagens de particionamento do relax and fix e nova proposta de PLI para o problema da filogenia viva com politomia
Abstract: A living phylogenetic tree with polytomy is a tree in which its internal nodes can include living objects and an internal node can generate two or more descendants. The objective of this work is to test the implementation of relax and fix with two matheuristics: sequential (stores the variables in the parts of the partition set in the sequence of the ordered set of the variables themselves), and random (stores the variables randomly in the parts of the partition set) with three different percentages (3%, 5%, and 10%) for the size of the parts of the partition set. The optimization libraries SCIP and Cplex were used to execute the problem, and the matheuristics were incorporated into a branch-and-bound algorithm. The results obtained with the proposed matheuristics did not achieve good bounded values. The higher the percentage, the fewer instances had solutions found, with the sequential matheuristic with 3% in the part size finding a solution in 5 instances. A new integer linear programming model for the living phylogeny problem was also proposed; however, the model was not implemented.
Tipo: Artigo de Evento</summary>
    <dc:date>2025-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Heurísticas para Calculo de Grandes Cliques em Grafos ´</title>
    <link rel="alternate" href="https://repositorio.ufms.br/handle/123456789/14029" />
    <author>
      <name />
    </author>
    <id>https://repositorio.ufms.br/handle/123456789/14029</id>
    <updated>2025-12-08T21:33:48Z</updated>
    <published>2025-01-01T00:00:00Z</published>
    <summary type="text">Título: Heurísticas para Calculo de Grandes Cliques em Grafos ´
Abstract: This paper documents an Atividade Orientada de Ensino (AOE),&#xD;
a supervised academic work registered as a non-disciplinary curricular activity&#xD;
within the UFMS program. The study focuses on the implementation and experimental&#xD;
evaluation of heuristics for computing large cliques in graphs and their effect&#xD;
on pruning during Zykov tree branching for graph coloring. Experiments are&#xD;
performed using timetabling instances from FACOM-UFMS, allowing performance&#xD;
measurement and analysis of search reduction in practical scenarios.
Tipo: Outros</summary>
    <dc:date>2025-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Chain-of-Thought Prompting para classificação de questões da OBI</title>
    <link rel="alternate" href="https://repositorio.ufms.br/handle/123456789/13342" />
    <author>
      <name />
    </author>
    <id>https://repositorio.ufms.br/handle/123456789/13342</id>
    <updated>2025-11-27T19:03:13Z</updated>
    <published>2025-01-01T00:00:00Z</published>
    <summary type="text">Título: Chain-of-Thought Prompting para classificação de questões da OBI
Abstract: This paper focuses on an analysis of the structure of questions in the OBI (Brazilian Informatics Olympiad) initiation category and explores how Chain-of-Thought prompting can be used for question classification, particularly to assess whether the currently available study materials are compatible with the most recent exams.
Tipo: Outros</summary>
    <dc:date>2025-01-01T00:00:00Z</dc:date>
  </entry>
</feed>

