Menu

Filtros : "Austrália" "Brazilian Symposium on Artificial Intelligence - SBIA" Removidos: "PCS" "Comin-Chiaramonti, P." Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • Trabalho de evento

    Symbolic bounded real-time dynamic programming (2010)

    Delgado, Karina Valdívia; Fang, cheng; Barros, Leliane Nunes de

    Source: Proceedings. Conference titles: Brazilian Symposium on Artificial Intelligence - SBIA. Unidades: EACH, IME

    Assunto: INTELIGÊNCIA ARTIFICIAL

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

    • ABNT

      DELGADO, Karina Valdívia e FANG, cheng e BARROS, Leliane Nunes de. Symbolic bounded real-time dynamic programming. 2010, Anais.. Berlin: Springer, 2010. Disponível em: https://doi.org/10.1007/978-3-642-16138-4_20. Acesso em: 16 jun. 2024.

    • APA

      Delgado, K. V., Fang, cheng, & Barros, L. N. de. (2010). Symbolic bounded real-time dynamic programming. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-16138-4_20

    • NLM

      Delgado KV, Fang cheng, Barros LN de. Symbolic bounded real-time dynamic programming [Internet]. Proceedings. 2010 ;[citado 2024 jun. 16 ] Available from: https://doi.org/10.1007/978-3-642-16138-4_20

    • Vancouver

      Delgado KV, Fang cheng, Barros LN de. Symbolic bounded real-time dynamic programming [Internet]. Proceedings. 2010 ;[citado 2024 jun. 16 ] Available from: https://doi.org/10.1007/978-3-642-16138-4_20

  • Trabalho de evento

    Attacking the complexity of prioritized inference preliminary report (2002)

    Wassermann, Renata ; Chopra, Samir

    Source: Proceedings. Conference titles: Brazilian Symposium on Artificial Intelligence - SBIA. Unidade: IME

    Subjects: INTELIGÊNCIA ARTIFICIAL, REVISÃO DE CRENÇAS

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

    • ABNT

      WASSERMANN, Renata e CHOPRA, Samir. Attacking the complexity of prioritized inference preliminary report. 2002, Anais.. Berlin: Springer, 2002. Disponível em: https://doi.org/10.1007/3-540-36127-8_4. Acesso em: 16 jun. 2024.

    • APA

      Wassermann, R., & Chopra, S. (2002). Attacking the complexity of prioritized inference preliminary report. In Proceedings. Berlin: Springer. doi:10.1007/3-540-36127-8_4

    • NLM

      Wassermann R, Chopra S. Attacking the complexity of prioritized inference preliminary report [Internet]. Proceedings. 2002 ;[citado 2024 jun. 16 ] Available from: https://doi.org/10.1007/3-540-36127-8_4

    • Vancouver

      Wassermann R, Chopra S. Attacking the complexity of prioritized inference preliminary report [Internet]. Proceedings. 2002 ;[citado 2024 jun. 16 ] Available from: https://doi.org/10.1007/3-540-36127-8_4
  • 1

1 - 2 (2 records)

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