Zobrazeno 1 - 10
of 46
pro vyhledávání: '"de Freitas, Rosiane"'
This paper presents a comprehensive overview of monotone priority queues, focusing on their evolution and application in shortest path algorithms. Monotone priority queues are characterized by the property that their minimum key does not decrease ove
Externí odkaz:
http://arxiv.org/abs/2409.06061
Autor:
Menezes, Rafael Sá, Manino, Edoardo, Shmarov, Fedor, Aldughaim, Mohannad, de Freitas, Rosiane, Cordeiro, Lucas C.
Bounded Model Checking (BMC) is a widely used software verification technique. Despite its successes, the technique has several limiting factors, from state-space explosion to lack of completeness. Over the years, interval analysis has repeatedly bee
Externí odkaz:
http://arxiv.org/abs/2406.15281
Autor:
Braberman, Víctor A., Bonomo-Braberman, Flavia, Charalambous, Yiannis, Colonna, Juan G., Cordeiro, Lucas C., de Freitas, Rosiane
Prompting has become one of the main approaches to leverage emergent capabilities of Large Language Models [Brown et al. NeurIPS 2020, Wei et al. TMLR 2022, Wei et al. NeurIPS 2022]. Recently, researchers and practitioners have been "playing" with pr
Externí odkaz:
http://arxiv.org/abs/2404.09384
This paper presents an empirical performance analysis of three project scheduling algorithms dealing with maximizing projects' net present value with unrestricted resources. The selected algorithms, being the most recently cited in the literature, ar
Externí odkaz:
http://arxiv.org/abs/2207.03330
In this work, we describe and evaluate the first model checker for verifying Kotlin programs through the Jimple intermediate representation. The verifier, named ESBMC-Jimple, is built on top of the Efficient SMT-based Context-Bounded Model Checker (E
Externí odkaz:
http://arxiv.org/abs/2206.04397
Publikováno v:
In Theoretical Computer Science 1 June 2024 998
The list coloring problem is a variation of the classical vertex coloring problem, extensively studied in recent years, where each vertex has a restricted list of allowed colors, and having some variations as the $(\gamma,\mu)$-coloring, where the co
Externí odkaz:
http://arxiv.org/abs/1812.11685
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Procedia Computer Science 2023 223:394-396
One of the most important combinatorial optimization problems is graph coloring. There are several variations of this problem involving additional constraints either on vertices or edges. They constitute models for real applications, such as channel
Externí odkaz:
http://arxiv.org/abs/1606.04978