Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Ivan C. Martins"'
Autor:
Ivan C. Martins, Anthony E. A. Jatobá, Heitor S. Ramos, Douglas L. L. Moura, Andre L. L. Aquino
Publikováno v:
Anais do Workshop de Computação Aplicada em Governo Eletrônico (WCGE 2021).
Devido a mudanças constantes na legislação e a complexidade do sistema tributário brasileiro, determinar a tributação de um produto não é uma tarefa trivial. Com isso, este artigo apresenta uma proposta de ferramenta para o cálculo automáti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ddc76f2c2881dc38eed5e1109477d599
https://doi.org/10.5753/wcge.2021.15984
https://doi.org/10.5753/wcge.2021.15984
Publikováno v:
Computer Networks. 146:1-11
This paper presents a data sample algorithm applied to wireless sensor network applications with disruptive connections. Additionally, it defines a model for delay-tolerant sensor network where drop strategies are applied to improve the phenomenon co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a4a568f78add49faf3867bee65ba5b23
https://doi.org/10.1016/j.comnet.2018.09.006
https://doi.org/10.1016/j.comnet.2018.09.006
Autor:
Rian G. S. Pinheiro, Anand Subramanian, Fábio Protti, Ivan C. Martins, Luiz Satoru Ochi, Luidi Simonetti
Publikováno v:
European Journal of Operational Research. 254:769-779
This work investigates the Bicluster Graph Editing Problem (BGEP) and how it can be applied to solve the Manufacturing Cell Formation Problem (MCFP). We develop an exact method for the BGEP with a new separation algorithm. We also describe a new prep
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf5240ca280a8be4ef874243ff8b8bc9
https://doi.org/10.1016/j.ejor.2016.05.010
https://doi.org/10.1016/j.ejor.2016.05.010
Publikováno v:
Expert Systems with Applications. 42:8947-8955
We propose a new heuristic algorithm for the Cell Formation Problem.The algorithm is based on Iterated Local Search with Variable Neighborhood Descent.Our method finds several optimal solutions for benchmark instances from literature.Our method impro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f010c3b17a7ac1e254f676ce0c7b5165
https://doi.org/10.1016/j.eswa.2015.07.050
https://doi.org/10.1016/j.eswa.2015.07.050
Autor:
Keila Barbosa, Pedro H. Barros, Alejandro C. Frery, Isadora Cardoso-Pereira, Ivan C. Martins, Heitor S. Ramos, Héctor Allende-Cid
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319914848
HCI (14)
HCI (14)
This work aims at analyzing twitter data to identify communities of Brazilian Senators. To do so, we collected data from 76 Brazilian Senators and used autoencoder and bi-gram to the content of tweets to find similar subjects and hence cluster the se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::171fc4309ebcec92815463e616ac143b
https://doi.org/10.1007/978-3-319-91485-5_13
https://doi.org/10.1007/978-3-319-91485-5_13
Autor:
Luiz Satoru Ochi, Lucas de Oliveira Bastos, Ivan C. Martins, Rian G. S. Pinheiro, Fábio Protti, Anand Subramanian
Publikováno v:
Journal of Combinatorial Optimization. 31:347-371
The cluster editing problem consists of transforming an input graph $$G$$G into a cluster graph (a disjoint union of complete graphs) by performing a minimum number of edge editing operations. Each edge editing operation consists of either adding a n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3cc4246058d096bcc7da80559f1a3b19
https://doi.org/10.1007/s10878-014-9756-7
https://doi.org/10.1007/s10878-014-9756-7
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:
Optimization Letters; Mar2018, Vol. 12 Issue 2, p335-346, 12p