Filtros : "MÉTODOS PROBABILÍSTICOS" "Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)" Limpar

Filtros



Refine with date range


  • Source: Proceedings. Conference titles: Mexican International Conference on Artificial Intelligence - MICAI. Unidades: IME, EACH

    Subjects: PROCESSOS DE MARKOV, MÉTODOS PROBABILÍSTICOS

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      PASTOR, Henrique Dias et al. Risk-sensitive piecewise-linear policy iteration for stochastic shortest path Markov decision processes. 2020, Anais.. Cham: Springer, 2020. Disponível em: https://doi.org/10.1007/978-3-030-60884-2_28. Acesso em: 03 out. 2024.
    • APA

      Pastor, H. D., Borges, I. O., Silva, V. F. da, Delgado, K. V., & Barros, L. N. de. (2020). Risk-sensitive piecewise-linear policy iteration for stochastic shortest path Markov decision processes. In Proceedings. Cham: Springer. doi:10.1007/978-3-030-60884-2_28
    • NLM

      Pastor HD, Borges IO, Silva VF da, Delgado KV, Barros LN de. Risk-sensitive piecewise-linear policy iteration for stochastic shortest path Markov decision processes [Internet]. Proceedings. 2020 ;[citado 2024 out. 03 ] Available from: https://doi.org/10.1007/978-3-030-60884-2_28
    • Vancouver

      Pastor HD, Borges IO, Silva VF da, Delgado KV, Barros LN de. Risk-sensitive piecewise-linear policy iteration for stochastic shortest path Markov decision processes [Internet]. Proceedings. 2020 ;[citado 2024 out. 03 ] Available from: https://doi.org/10.1007/978-3-030-60884-2_28
  • Source: Random Structures & Algorithms. Unidade: IME

    Subjects: GRAFOS ALEATÓRIOS, MÉTODOS PROBABILÍSTICOS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      KOHAYAKAWA, Yoshiharu e RETTER, Troy e RODL, Vojtech. The size Ramsey number of short subdivisions of bounded degree graphs. Random Structures & Algorithms, v. 54, n. 2, p. 304-339, 2019Tradução . . Disponível em: https://doi.org/10.1002/rsa.20783. Acesso em: 03 out. 2024.
    • APA

      Kohayakawa, Y., Retter, T., & Rodl, V. (2019). The size Ramsey number of short subdivisions of bounded degree graphs. Random Structures & Algorithms, 54( 2), 304-339. doi:10.1002/rsa.20783
    • NLM

      Kohayakawa Y, Retter T, Rodl V. The size Ramsey number of short subdivisions of bounded degree graphs [Internet]. Random Structures & Algorithms. 2019 ; 54( 2): 304-339.[citado 2024 out. 03 ] Available from: https://doi.org/10.1002/rsa.20783
    • Vancouver

      Kohayakawa Y, Retter T, Rodl V. The size Ramsey number of short subdivisions of bounded degree graphs [Internet]. Random Structures & Algorithms. 2019 ; 54( 2): 304-339.[citado 2024 out. 03 ] Available from: https://doi.org/10.1002/rsa.20783
  • Source: Combinatorics, Probability & Computing. Unidade: IME

    Subjects: TEORIA DOS NÚMEROS, SEQUÊNCIAS, COMBINATÓRIA, MÉTODOS PROBABILÍSTICOS

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      DELLAMONICA JUNIOR, Domingos et al. On the number of Bh-Sets. Combinatorics, Probability & Computing, v. 25, n. Ja 2016, p. 108-129, 2016Tradução . . Disponível em: https://doi.org/10.1017/S0963548315000206. Acesso em: 03 out. 2024.
    • APA

      Dellamonica Junior, D., Kohayakawa, Y., Lee, S. J., Rodl, V., & Samotij, W. (2016). On the number of Bh-Sets. Combinatorics, Probability & Computing, 25( Ja 2016), 108-129. doi:10.1017/S0963548315000206
    • NLM

      Dellamonica Junior D, Kohayakawa Y, Lee SJ, Rodl V, Samotij W. On the number of Bh-Sets [Internet]. Combinatorics, Probability & Computing. 2016 ; 25( Ja 2016): 108-129.[citado 2024 out. 03 ] Available from: https://doi.org/10.1017/S0963548315000206
    • Vancouver

      Dellamonica Junior D, Kohayakawa Y, Lee SJ, Rodl V, Samotij W. On the number of Bh-Sets [Internet]. Combinatorics, Probability & Computing. 2016 ; 25( Ja 2016): 108-129.[citado 2024 out. 03 ] Available from: https://doi.org/10.1017/S0963548315000206
  • Source: An irregular mind. Unidade: IME

    Subjects: MÉTODOS PROBABILÍSTICOS, TEORIA DOS GRAFOS

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      KOHAYAKAWA, Yoshiharu et al. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs. An irregular mind. Tradução . Berlin: Springer, 2010. . Disponível em: https://doi.org/10.1007/978-3-642-14444-8_10. Acesso em: 03 out. 2024.
    • APA

      Kohayakawa, Y., RÖdlt, V. Ě., Schacht, M., & Skokan, J. (2010). On the triangle removal lemma for subgraphs of sparse pseudorandom graphs. In An irregular mind. Berlin: Springer. doi:10.1007/978-3-642-14444-8_10
    • NLM

      Kohayakawa Y, RÖdlt VĚ, Schacht M, Skokan J. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs [Internet]. In: An irregular mind. Berlin: Springer; 2010. [citado 2024 out. 03 ] Available from: https://doi.org/10.1007/978-3-642-14444-8_10
    • Vancouver

      Kohayakawa Y, RÖdlt VĚ, Schacht M, Skokan J. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs [Internet]. In: An irregular mind. Berlin: Springer; 2010. [citado 2024 out. 03 ] Available from: https://doi.org/10.1007/978-3-642-14444-8_10

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2024