ReP USP - Resultado da busca

Artigo de periodico
A profile-based AI-assisted dynamic scheduling approach for heterogeneous architectures (2022)
Geng, Tongsheng ; Amarís, Marcos ; Zuckerman, Stéphane ; Goldman, Alfredo ; Gao, Guang R.; Gaudiot, Jean-Luc
Source: International Journal of Parallel Programming. Unidade: IME
Subjects: APRENDIZADO COMPUTACIONAL, SCHEDULING
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GENG, Tongsheng et al. A profile-based AI-assisted dynamic scheduling approach for heterogeneous architectures. International Journal of Parallel Programming, v. 50, n. 1, p. 115-151, 2022Tradução . . Disponível em: https://doi.org/10.1007/s10766-021-00721-2. Acesso em: 04 ago. 2024.
APA
Geng, T., Amarís, M., Zuckerman, S., Goldman, A., Gao, G. R., & Gaudiot, J. -L. (2022). A profile-based AI-assisted dynamic scheduling approach for heterogeneous architectures. International Journal of Parallel Programming, 50( 1), 115-151. doi:10.1007/s10766-021-00721-2
NLM
Geng T, Amarís M, Zuckerman S, Goldman A, Gao GR, Gaudiot J-L. A profile-based AI-assisted dynamic scheduling approach for heterogeneous architectures [Internet]. International Journal of Parallel Programming. 2022 ; 50( 1): 115-151.[citado 2024 ago. 04 ] Available from: https://doi.org/10.1007/s10766-021-00721-2
Vancouver
Geng T, Amarís M, Zuckerman S, Goldman A, Gao GR, Gaudiot J-L. A profile-based AI-assisted dynamic scheduling approach for heterogeneous architectures [Internet]. International Journal of Parallel Programming. 2022 ; 50( 1): 115-151.[citado 2024 ago. 04 ] Available from: https://doi.org/10.1007/s10766-021-00721-2
Trabalho de evento
An improved upper bound on the density of universal random graphs (2012)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Rucinski, Andrzej
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos et al. An improved upper bound on the density of universal random graphs. 2012, Anais.. Berlin: Springer, 2012. Disponível em: https://doi.org/10.1007/978-3-642-29344-3_20. Acesso em: 04 ago. 2024.
APA
Dellamonica Junior, D., Kohayakawa, Y., Rodl, V., & Rucinski, A. (2012). An improved upper bound on the density of universal random graphs. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-29344-3_20
NLM
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Proceedings. 2012 ;[citado 2024 ago. 04 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_20
Vancouver
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Proceedings. 2012 ;[citado 2024 ago. 04 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_20
Trabalho de evento
Maximum series-parallel subgraph (2010)
Calinescu, Gruia ; Fernandes, Cristina Gomes ; Kaul, Hemanshu
Source: Proceedings. Conference titles: International Workshop on Graph-Theoretic Concepts in Computer Science - WG. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CALINESCU, Gruia e FERNANDES, Cristina Gomes e KAUL, Hemanshu. Maximum series-parallel subgraph. 2010, Anais.. Berlin: Springer, 2010. Disponível em: https://doi.org/10.1007/978-3-642-11409-0_5. Acesso em: 04 ago. 2024.
APA
Calinescu, G., Fernandes, C. G., & Kaul, H. (2010). Maximum series-parallel subgraph. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-11409-0_5
NLM
Calinescu G, Fernandes CG, Kaul H. Maximum series-parallel subgraph [Internet]. Proceedings. 2010 ;[citado 2024 ago. 04 ] Available from: https://doi.org/10.1007/978-3-642-11409-0_5
Vancouver
Calinescu G, Fernandes CG, Kaul H. Maximum series-parallel subgraph [Internet]. Proceedings. 2010 ;[citado 2024 ago. 04 ] Available from: https://doi.org/10.1007/978-3-642-11409-0_5
Trabalho de evento
Multicuts in unweighted graphs with bounded degree and bounded tree-width (1998)
Calinescu, Gruia ; Fernandes, Cristina Gomes ; Reed, Bruce
Source: Proceedings. Conference titles: Integer Programming and Combinatorial Optimization - IPCO. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CALINESCU, Gruia e FERNANDES, Cristina Gomes e REED, Bruce. Multicuts in unweighted graphs with bounded degree and bounded tree-width. 1998, Anais.. Berlin: Springer, 1998. Disponível em: https://doi.org/10.1007/3-540-69346-7_11. Acesso em: 04 ago. 2024.
APA
Calinescu, G., Fernandes, C. G., & Reed, B. (1998). Multicuts in unweighted graphs with bounded degree and bounded tree-width. In Proceedings. Berlin: Springer. doi:10.1007/3-540-69346-7_11
NLM
Calinescu G, Fernandes CG, Reed B. Multicuts in unweighted graphs with bounded degree and bounded tree-width [Internet]. Proceedings. 1998 ;[citado 2024 ago. 04 ] Available from: https://doi.org/10.1007/3-540-69346-7_11
Vancouver
Calinescu G, Fernandes CG, Reed B. Multicuts in unweighted graphs with bounded degree and bounded tree-width [Internet]. Proceedings. 1998 ;[citado 2024 ago. 04 ] Available from: https://doi.org/10.1007/3-540-69346-7_11

USP Schools

ReP

Filtros

Authors

Funding Agencies

Non normalized affiliation