Zobrazeno 1 - 10
of 193
pro vyhledávání: '"Lima, Murilo"'
Learning-augmented algorithms have been attracting increasing interest, but have only recently been considered in the setting of explorable uncertainty where precise values of uncertain input elements can be obtained by a query and the goal is to min
Externí odkaz:
http://arxiv.org/abs/2305.09245
Autor:
Rocha Lima, Murilo Campos1 murilo20_@hotmail.com, da Costa Borba, Marcelo2 marcelodcborba@gmail.com, Santos Ramos, Josefa Edileide3 edileideramos@gmail.com, da Silva Canela, Danilo Crisóstomo4 danilocrisostomo@gmail.com, Callegaro de Menezes, Daniela5 daniela.callegaro@ufrgs.br, Palma Révillion, Jean Philippe1 jeanppr@gmail.com
Publikováno v:
GeSec: Revista de Gestao e Secretariado. 2024, Vol. 15 Issue 8, p1-21. 21p.
Autor:
Rocha Lima, Murilo Campos1 murilo20_@hotmail.com, da Costa Borba, Marcelo2 marcelodcborba@gmail.com, Santos Ramos, Josefa Edileide3 edileideramos@gmail.com, da Silva Canela, Danilo Crisóstomo4 danilocrisostomo@gmail.com, Callegaro de Menezes, Daniela5 daniela.callegaro@ufrgs.br, Palma Révillion, Jean Philippe1 jeanppr@gmail.com
Publikováno v:
GeSec: Revista de Gestao e Secretariado. 2024, Vol. 15 Issue 8, p1-20. 20p.
We study how to utilize (possibly erroneous) predictions in a model for computing under uncertainty in which an algorithm can query unknown data. Our aim is to minimize the number of queries needed to solve the minimum spanning tree problem, a fundam
Externí odkaz:
http://arxiv.org/abs/2206.15201
Autor:
Lima, Murilo Santos de
Muitos problemas de otimização em grafos, em especial problemas métricos, são mais fáceis de resolver em árvores. Portanto, uma estratégia para obter um bom algoritmo para certos problemas é obter uma árvore que aproxime o grafo, e utilizar
Autor:
Lima, Murilo Paes
A implantação de estruturas como o Escritório de Gerenciamento de Projetos (EGP) é uma ação que tem sido muito utilizada recentemente visando desenvolver e aprimorar a gestão de projetos nas organizações. Num momento em que cada vez mais as
Autor:
Bampis, Evripidis, Dürr, Christoph, Erlebach, Thomas, de Lima, Murilo S., Megow, Nicole, Schlöter, Jens
Given a hypergraph with uncertain node weights following known probability distributions, we study the problem of querying as few nodes as possible until the identity of a node with minimum weight can be determined for each hyperedge. Querying a node
Externí odkaz:
http://arxiv.org/abs/2107.00572
The area of computing with uncertainty considers problems where some information about the input elements is uncertain, but can be obtained using queries. For example, instead of the weight of an element, we may be given an interval that is guarantee
Externí odkaz:
http://arxiv.org/abs/2101.05032
Publikováno v:
Theoretical Computer Science 867 (2021) 50-67
We study the problem of sorting under incomplete information, when queries are used to resolve uncertainties. Each of $n$ data items has an unknown value, which is known to lie in a given interval. We can pay a query cost to learn the actual value, a
Externí odkaz:
http://arxiv.org/abs/2012.09475
We study how to utilize (possibly machine-learned) predictions in a model for computing under uncertainty in which an algorithm can query unknown data. The goal is to minimize the number of queries needed to solve the problem. We consider fundamental
Externí odkaz:
http://arxiv.org/abs/2011.07385