ReP USP - Resultado da busca

Trabalho de evento
Linking Łukasiewicz logic and boolean maximum satisfiability (2023)
Preto, Sandro ; Manyà, Felip ; Finger, Marcelo
Source: Proceedings. Conference titles: International Symposium on Multiple-Valued Logic - ISMVL. Unidade: IME
Subjects: COMPUTABILIDADE E COMPLEXIDADE, LÓGICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PRETO, Sandro e MANYÀ, Felip e FINGER, Marcelo. Linking Łukasiewicz logic and boolean maximum satisfiability. 2023, Anais.. Piscataway: IEEE, 2023. Disponível em: https://doi.org/10.1109/ISMVL57333.2023.00040. Acesso em: 27 nov. 2025.
APA
Preto, S., Manyà, F., & Finger, M. (2023). Linking Łukasiewicz logic and boolean maximum satisfiability. In Proceedings. Piscataway: IEEE. doi:10.1109/ISMVL57333.2023.00040
NLM
Preto S, Manyà F, Finger M. Linking Łukasiewicz logic and boolean maximum satisfiability [Internet]. Proceedings. 2023 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1109/ISMVL57333.2023.00040
Vancouver
Preto S, Manyà F, Finger M. Linking Łukasiewicz logic and boolean maximum satisfiability [Internet]. Proceedings. 2023 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1109/ISMVL57333.2023.00040
Artigo de periodico
Balanced connected partitions of graphs: approximation, parameterization and lower bounds (2023)
Moura, Phablo Fernando Soares ; Ota, Matheus Jun ; Wakabayashi, Yoshiko
Source: Journal of Combinatorial Optimization. Unidade: IME
Subjects: COMPUTABILIDADE E COMPLEXIDADE, ALGORITMOS DE APROXIMAÇÃO, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOURA, Phablo Fernando Soares e OTA, Matheus Jun e WAKABAYASHI, Yoshiko. Balanced connected partitions of graphs: approximation, parameterization and lower bounds. Journal of Combinatorial Optimization, v. 45, n. artigo 127, p. 1-27, 2023Tradução . . Disponível em: https://doi.org/10.1007/s10878-023-01058-x. Acesso em: 27 nov. 2025.
APA
Moura, P. F. S., Ota, M. J., & Wakabayashi, Y. (2023). Balanced connected partitions of graphs: approximation, parameterization and lower bounds. Journal of Combinatorial Optimization, 45( artigo 127), 1-27. doi:10.1007/s10878-023-01058-x
NLM
Moura PFS, Ota MJ, Wakabayashi Y. Balanced connected partitions of graphs: approximation, parameterization and lower bounds [Internet]. Journal of Combinatorial Optimization. 2023 ; 45( artigo 127): 1-27.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10878-023-01058-x
Vancouver
Moura PFS, Ota MJ, Wakabayashi Y. Balanced connected partitions of graphs: approximation, parameterization and lower bounds [Internet]. Journal of Combinatorial Optimization. 2023 ; 45( artigo 127): 1-27.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10878-023-01058-x
Artigo de periodico
Techniques and results on approximation algorithms for packing circles (2022)
Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: São Paulo Journal of Mathematical Sciences. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, COMPUTABILIDADE E COMPLEXIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Techniques and results on approximation algorithms for packing circles. São Paulo Journal of Mathematical Sciences, v. 16, n. 1, p. 585-615, 2022Tradução . . Disponível em: https://doi.org/10.1007/s40863-022-00301-3. Acesso em: 27 nov. 2025.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2022). Techniques and results on approximation algorithms for packing circles. São Paulo Journal of Mathematical Sciences, 16( 1), 585-615. doi:10.1007/s40863-022-00301-3
NLM
Miyazawa FK, Wakabayashi Y. Techniques and results on approximation algorithms for packing circles [Internet]. São Paulo Journal of Mathematical Sciences. 2022 ; 16( 1): 585-615.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s40863-022-00301-3
Vancouver
Miyazawa FK, Wakabayashi Y. Techniques and results on approximation algorithms for packing circles [Internet]. São Paulo Journal of Mathematical Sciences. 2022 ; 16( 1): 585-615.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s40863-022-00301-3
Trabalho de evento
Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity (2015)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Source: Proceedings. Conference titles: AAAI Conference on Artificial Intelligence. Unidades: EP, IME
Subjects: COMPUTABILIDADE E COMPLEXIDADE, INTELIGÊNCIA ARTIFICIAL, PROBABILIDADE APLICADA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity. 2015, Anais.. Palo Alto: AAAI Press, 2015. Disponível em: http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9312. Acesso em: 27 nov. 2025.
APA
Cozman, F. G., & Mauá, D. D. (2015). Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity. In Proceedings. Palo Alto: AAAI Press. Recuperado de http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9312
NLM
Cozman FG, Mauá DD. Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity [Internet]. Proceedings. 2015 ;[citado 2025 nov. 27 ] Available from: http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9312
Vancouver
Cozman FG, Mauá DD. Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity [Internet]. Proceedings. 2015 ;[citado 2025 nov. 27 ] Available from: http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9312
Trabalho de evento
Jump-miss binary erosion algorithm (2009)
Machado, Anderson Fraiha; Hashimoto, Ronaldo Fumio
Source: Proceedings. Conference titles: Brazilian Symposium on Computer Graphics and Image Processing - SIBGRAPI. Unidade: IME
Subjects: PROCESSAMENTO DE IMAGENS, COMPUTABILIDADE E COMPLEXIDADE, ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MACHADO, Anderson Fraiha e HASHIMOTO, Ronaldo Fumio. Jump-miss binary erosion algorithm. 2009, Anais.. Piscataway: IEEE, 2009. Disponível em: https://doi.org/10.1109/SIBGRAPI.2009.27. Acesso em: 27 nov. 2025.
APA
Machado, A. F., & Hashimoto, R. F. (2009). Jump-miss binary erosion algorithm. In Proceedings. Piscataway: IEEE. doi:10.1109/SIBGRAPI.2009.27
NLM
Machado AF, Hashimoto RF. Jump-miss binary erosion algorithm [Internet]. Proceedings. 2009 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1109/SIBGRAPI.2009.27
Vancouver
Machado AF, Hashimoto RF. Jump-miss binary erosion algorithm [Internet]. Proceedings. 2009 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1109/SIBGRAPI.2009.27
Trabalho de evento
SIMD algorithms for matrix multiplication on the hypercube (1994)
Sanches, Carlos Alberto Alonso; Song, Siang Wun
Source: Proceedings. Conference titles: International Parallel Processing Symposium. Unidade: IME
Subjects: PROGRAMAÇÃO PARALELA, COMPUTABILIDADE E COMPLEXIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SANCHES, Carlos Alberto Alonso e SONG, Siang Wun. SIMD algorithms for matrix multiplication on the hypercube. 1994, Anais.. Piscataway: IEEE, 1994. Disponível em: https://doi.org/10.1109/IPPS.1994.288258. Acesso em: 27 nov. 2025.
APA
Sanches, C. A. A., & Song, S. W. (1994). SIMD algorithms for matrix multiplication on the hypercube. In Proceedings. Piscataway: IEEE. doi:10.1109/IPPS.1994.288258
NLM
Sanches CAA, Song SW. SIMD algorithms for matrix multiplication on the hypercube [Internet]. Proceedings. 1994 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1109/IPPS.1994.288258
Vancouver
Sanches CAA, Song SW. SIMD algorithms for matrix multiplication on the hypercube [Internet]. Proceedings. 1994 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1109/IPPS.1994.288258

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Subjects

Funding Agencies