Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Fabiano S. Oliveira"'
Publikováno v:
Discrete Applied Mathematics. 323:236-251
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19b198d4ca1eb1ab07184c3ca1267288
https://doi.org/10.1016/j.dam.2021.12.029
https://doi.org/10.1016/j.dam.2021.12.029
Publikováno v:
Trends in Computational and Applied Mathematics, Vol 20, Iss 3 (2019)
A complexidade de pior caso do ShellSort, um algoritmo de ordenação por comparação, depende de uma sequência de passos dada de entrada. Cada passo consiste de um inteiro representando a diferença de índices dos pares de elementos que devem ser
Externí odkaz:
https://doaj.org/article/a9070f3c3e604485bb6c8f6431ac685e
Publikováno v:
RAIRO - Operations Research. 56:1823-1839
We study a special case of Hamming–Huffman trees, in which both data compression and data error detection are tackled on the same structure. Given a hypercube Qn of dimension n, we are interested in some aspects of its vertex neighborhoods. For a s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a5e4d7d76b0601fe1323c6cb0e312fce
https://doi.org/10.1051/ro/2022066
https://doi.org/10.1051/ro/2022066
Publikováno v:
Journal of Graph Theory.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9b67572608557ca412f6feb289ba752
https://doi.org/10.1002/jgt.22948
https://doi.org/10.1002/jgt.22948
Publikováno v:
Anais do VII Encontro de Teoria da Computação (ETC 2022).
A subclasse LEN(a1,a2,...,ak) dos grafos de intervalo consiste daqueles que admitem um modelo de intervalo tendo precisamente os tamanhos de intervalo a1,a2,...,ak. Para todo 0 < a1 < a2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89ca9a2a31b202cc29a1d3a428b3a7cc
https://doi.org/10.5753/etc.2022.222484
https://doi.org/10.5753/etc.2022.222484
Publikováno v:
Anais do VII Encontro de Teoria da Computação (ETC 2022).
We introduce a new class of intersection graphs, the edge intersection graphs of paths on a triangular grid, called EPGt graphs. We compare this new class with the well-known class of EPG graphs. A turn of a path at a grid point is called a bend. An
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b24f206b29c2bc012b40f9d605f2a51
https://doi.org/10.5753/etc.2022.222476
https://doi.org/10.5753/etc.2022.222476
Autor:
Flavia Bonomo‐Braberman, Julliano R. Nascimento, Fabiano S. Oliveira, Uéverton S. Souza, Jayme L. Szwarcfiter
Since many NP-complete graph problems have been shown polynomial-time solvable when restricted to claw-free graphs, we study the problem of determining the distance of a given graph to a claw-free graph, considering vertex elimination as measure. CLA
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5db316395031f60564b7b1570a8002bd
Autor:
Luis Chiganer, Luiz Biondi Neto, Elias Restum Antonio, Fabiano S. Oliveira, Vincenzo de Roberto Junior, Marcos Pereira Estellita Lins, Fernando Hideo Fukuda
Publikováno v:
Anais do 5. Congresso Brasileiro de Redes Neurais.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::23a73626ea478b4cd45bb47f9998472a
https://doi.org/10.21528/cbrn2001-069
https://doi.org/10.21528/cbrn2001-069
Publikováno v:
IFAC Proceedings Volumes. 31:39-43
In this work a stochastic fomulation of the CAPM (Capital Market Pricing Model) called CAPMVAR, is presented. In the proposed fomulation the coefficients α and β of the model follow a first order vector autoregressive process, which parameters are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34d3d4bc7ecc2ff12068088e232e36f8
https://doi.org/10.1016/s1474-6670(17)40456-3
https://doi.org/10.1016/s1474-6670(17)40456-3
Autor:
de Figueiredo, Celina M. H.1 (AUTHOR), de Melo, Alexsander A.1 (AUTHOR), Oliveira, Fabiano S.2 (AUTHOR), Silva, Ana3 (AUTHOR) anasilva@mat.ufc.br
Publikováno v:
Journal of Graph Theory. Sep2023, Vol. 104 Issue 1, p5-16. 12p.