Filtros : "Alemanha" "Brazilian Symposium on Artificial Intelligence - SBIA" Removidos: "2004" "FD" Limpar

Filtros



Refine with date range


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

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

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

      LUNDBERG, Renato U e RIBEIRO, Márcio Moretto e WASSERMANN, Renata. A framework for empirical evaluation of belief change operators. 2012, Anais.. Berlin: Springer, 2012. Disponível em: https://doi.org/10.1007/978-3-642-34459-6_2. Acesso em: 12 jul. 2024.
    • APA

      Lundberg, R. U., Ribeiro, M. M., & Wassermann, R. (2012). A framework for empirical evaluation of belief change operators. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-34459-6_2
    • NLM

      Lundberg RU, Ribeiro MM, Wassermann R. A framework for empirical evaluation of belief change operators [Internet]. Proceedings. 2012 ;[citado 2024 jul. 12 ] Available from: https://doi.org/10.1007/978-3-642-34459-6_2
    • Vancouver

      Lundberg RU, Ribeiro MM, Wassermann R. A framework for empirical evaluation of belief change operators [Internet]. Proceedings. 2012 ;[citado 2024 jul. 12 ] Available from: https://doi.org/10.1007/978-3-642-34459-6_2
  • 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: 12 jul. 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 jul. 12 ] 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 jul. 12 ] Available from: https://doi.org/10.1007/978-3-642-16138-4_20
  • Source: Proceedings. Conference titles: Brazilian Symposium on Artificial Intelligence - SBIA. Unidades: IME, EP

    Subjects: RACIOCÍNIO PROBABILÍSTICO, LÓGICA

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

      FINGER, Marcelo e DE BONA, Glauber. A refuted conjecture on probabilistic satisfiability. 2010, Anais.. Berlin: Springer, 2010. Disponível em: https://doi.org/10.1007/978-3-642-16138-4_30. Acesso em: 12 jul. 2024.
    • APA

      Finger, M., & De Bona, G. (2010). A refuted conjecture on probabilistic satisfiability. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-16138-4_30
    • NLM

      Finger M, De Bona G. A refuted conjecture on probabilistic satisfiability [Internet]. Proceedings. 2010 ;[citado 2024 jul. 12 ] Available from: https://doi.org/10.1007/978-3-642-16138-4_30
    • Vancouver

      Finger M, De Bona G. A refuted conjecture on probabilistic satisfiability [Internet]. Proceedings. 2010 ;[citado 2024 jul. 12 ] Available from: https://doi.org/10.1007/978-3-642-16138-4_30
  • Source: Proceedings. Conference titles: Brazilian Symposium on Artificial Intelligence - SBIA. Unidade: IME

    Assunto: INTELIGÊNCIA ARTIFICIAL

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

      MENEZES, Maria Viviane de e PAREIRA, Silvio do L e BARROS, Leliane Nunes de. System design modification with actions. 2010, Anais.. Berlin: Springer, 2010. Disponível em: https://doi.org/10.1007/978-3-642-16138-4_4. Acesso em: 12 jul. 2024.
    • APA

      Menezes, M. V. de, Pareira, S. do L., & Barros, L. N. de. (2010). System design modification with actions. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-16138-4_4
    • NLM

      Menezes MV de, Pareira S do L, Barros LN de. System design modification with actions [Internet]. Proceedings. 2010 ;[citado 2024 jul. 12 ] Available from: https://doi.org/10.1007/978-3-642-16138-4_4
    • Vancouver

      Menezes MV de, Pareira S do L, Barros LN de. System design modification with actions [Internet]. Proceedings. 2010 ;[citado 2024 jul. 12 ] Available from: https://doi.org/10.1007/978-3-642-16138-4_4
  • Source: Proceedings. Conference titles: Brazilian Symposium on Artificial Intelligence - SBIA. Unidade: IME

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

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

      FINGER, Marcelo e WASSERMANN, Renata. Revising specifications with CTL properties using bounded model checking. 2008, Anais.. Berlin: Springer, 2008. Disponível em: https://doi.org/10.1007/978-3-540-88190-2_21. Acesso em: 12 jul. 2024.
    • APA

      Finger, M., & Wassermann, R. (2008). Revising specifications with CTL properties using bounded model checking. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-88190-2_21
    • NLM

      Finger M, Wassermann R. Revising specifications with CTL properties using bounded model checking [Internet]. Proceedings. 2008 ;[citado 2024 jul. 12 ] Available from: https://doi.org/10.1007/978-3-540-88190-2_21
    • Vancouver

      Finger M, Wassermann R. Revising specifications with CTL properties using bounded model checking [Internet]. Proceedings. 2008 ;[citado 2024 jul. 12 ] Available from: https://doi.org/10.1007/978-3-540-88190-2_21
  • Source: Lecture Notes in Computer Science. Conference titles: Brazilian Symposium on Artificial Intelligence - SBIA. Unidades: ICMC, EACH

    Subjects: INTELIGÊNCIA ARTIFICIAL, LINGUAGEM NATURAL

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

      AZIZ, Wilker Ferreira e PARDO, Thiago Alexandre Salgueiro e PARABONI, Ivandré. An experiment in spanish-portuguese statistical machine translation. Lecture Notes in Computer Science. Heidelberg: Springer-Verlag. Disponível em: http://www.springerlink.com/content/?k=%22an+experiment+in+spanish-portuguese+statistical+machine+translation%22. Acesso em: 12 jul. 2024. , 2008
    • APA

      Aziz, W. F., Pardo, T. A. S., & Paraboni, I. (2008). An experiment in spanish-portuguese statistical machine translation. Lecture Notes in Computer Science. Heidelberg: Springer-Verlag. Recuperado de http://www.springerlink.com/content/?k=%22an+experiment+in+spanish-portuguese+statistical+machine+translation%22
    • NLM

      Aziz WF, Pardo TAS, Paraboni I. An experiment in spanish-portuguese statistical machine translation [Internet]. Lecture Notes in Computer Science. 2008 ; 5249 248-257.[citado 2024 jul. 12 ] Available from: http://www.springerlink.com/content/?k=%22an+experiment+in+spanish-portuguese+statistical+machine+translation%22
    • Vancouver

      Aziz WF, Pardo TAS, Paraboni I. An experiment in spanish-portuguese statistical machine translation [Internet]. Lecture Notes in Computer Science. 2008 ; 5249 248-257.[citado 2024 jul. 12 ] Available from: http://www.springerlink.com/content/?k=%22an+experiment+in+spanish-portuguese+statistical+machine+translation%22
  • 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: 12 jul. 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 jul. 12 ] 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 jul. 12 ] Available from: https://doi.org/10.1007/3-540-36127-8_4
  • Source: Proceedings. Conference titles: Brazilian Symposium on Artificial Intelligence - SBIA. Unidade: IME

    Assunto: INTELIGÊNCIA ARTIFICIAL

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

      FINGER, Marcelo e WASSERMANN, Renata. Logics for approximate reasoning: approximating classical logic “from above”. 2002, Anais.. Berlin: Springer, 2002. Disponível em: https://doi.org/10.1007/3-540-36127-8_3. Acesso em: 12 jul. 2024.
    • APA

      Finger, M., & Wassermann, R. (2002). Logics for approximate reasoning: approximating classical logic “from above”. In Proceedings. Berlin: Springer. doi:10.1007/3-540-36127-8_3
    • NLM

      Finger M, Wassermann R. Logics for approximate reasoning: approximating classical logic “from above” [Internet]. Proceedings. 2002 ;[citado 2024 jul. 12 ] Available from: https://doi.org/10.1007/3-540-36127-8_3
    • Vancouver

      Finger M, Wassermann R. Logics for approximate reasoning: approximating classical logic “from above” [Internet]. Proceedings. 2002 ;[citado 2024 jul. 12 ] Available from: https://doi.org/10.1007/3-540-36127-8_3

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