Zobrazeno 1 - 10
of 181
pro vyhledávání: '"Satoru Ochi"'
Autor:
Braga Flôr, Vinícius B., Do Coutto Filho, Milton B., Stachinni de Souza, Julio C., Satoru Ochi, Luiz
Publikováno v:
In International Journal of Electrical Power and Energy Systems June 2022 138
Publikováno v:
Soft Computing. 27:4699-4712
Autor:
Marques Jr., Elias L., Coelho, Vitor N., Coelho, Igor M., Satoru Ochi, Luiz, Maculan, Nelson, Mladenović, Nenad, Coelho, Bruno N.
Publikováno v:
Optimization Letters; Dec2023, Vol. 17 Issue 9, p2233-2256, 24p
Autor:
Elias L. Marques, Vitor N. Coelho, Igor M. Coelho, Luiz Satoru Ochi, Nelson Maculan, Nenad Mladenović, Bruno N. Coelho
Publikováno v:
Optimization Letters.
Publikováno v:
Annals of Telecommunications. 77:457-471
Autor:
Silvio E. Quincozes, Diego Passos, Daniel Mosse, Luiz Satoru Ochi, Vinícius F. dos Santos, Célio Albuquerque
Publikováno v:
IEEE Transactions on Network and Service Management. 19:614-626
Cyber-Physical Systems (CPS) are the basis for the world’s critical infrastructure and, thus, have the potential to significantly impact human lives in the near future. In recent years, there has been an increasing demand for connectivity in CPS, w
Autor:
Elias L. Marques, Vitor N. Coelho, Igor M. Coelho, Yuri A. de M. Frota, Roozbeh H. Koochaksaraei, Luiz Satoru Ochi, Bruno N. Coelho
Publikováno v:
RAIRO - Operations Research. 56:853-869
Unmanned Aerial Vehicles are becoming a common technology used on smart cities and smart regions, thus requiring optimization of its routes with crucial importance. In this innovative work, six objective functions are optimized in order to provide se
Autor:
Luiz Satoru Ochi, Teobaldo Bulhões, Lucídio dos Anjos Formiga Cabral, Fábio Protti, Rian G. S. Pinheiro, Gilberto Farias de Sousa Filho
Publikováno v:
Discrete Applied Mathematics. 301:118-130
Given a bipartite graph G = ( V 1 , V 2 , E ) , a biclique of G is a complete bipartite subgraph of G , and a biclique partitioning of G is a set A ⊆ E such that the bipartite graph G ′ = ( V 1 , V 2 , A ) is a vertex-disjoint union of bicliques.
Publikováno v:
In Computers and Operations Research December 2013 40(12):3218-3229
Publikováno v:
Anais do XXXV Concurso de Teses e Dissertações (CTD 2022).
This thesis investigates several aspects of computational problems related to circuits and neighborhood exploration. Supported by a vast literature, we explore notable trends in algorithms, optimization, and computational complexity; and we provide s