ReP USP - Resultado da busca

Trabalho de evento
Programmatic strategies for real-Time strategy games (2021)
Mariño, Julian Ricardo Hernandez ; Moraes, Rubens O; Oliveira, Tassiana C; Toledo, Claudio Fabiano Motta ; Lelis, Levi H. S
Source: Proceedings. Conference titles: AAAI Conference on Artificial Intelligence. Unidade: ICMC
Subjects: ENGENHARIA DE SOFTWARE, APRENDIZAGEM, JOGOS DE COMPUTADOR, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MARIÑO, Julian Ricardo Hernandez et al. Programmatic strategies for real-Time strategy games. 2021, Anais.. Palo Alto: AAAI, 2021. Disponível em: https://doi.org/10.1609/aaai.v35i1.16114. Acesso em: 29 maio 2024.
APA
Mariño, J. R. H., Moraes, R. O., Oliveira, T. C., Toledo, C. F. M., & Lelis, L. H. S. (2021). Programmatic strategies for real-Time strategy games. In Proceedings. Palo Alto: AAAI. doi:10.1609/aaai.v35i1.16114
NLM
Mariño JRH, Moraes RO, Oliveira TC, Toledo CFM, Lelis LHS. Programmatic strategies for real-Time strategy games [Internet]. Proceedings. 2021 ;[citado 2024 maio 29 ] Available from: https://doi.org/10.1609/aaai.v35i1.16114
Vancouver
Mariño JRH, Moraes RO, Oliveira TC, Toledo CFM, Lelis LHS. Programmatic strategies for real-Time strategy games [Internet]. Proceedings. 2021 ;[citado 2024 maio 29 ] Available from: https://doi.org/10.1609/aaai.v35i1.16114
Trabalho de evento
Deep reactive policies for planning in stochastic nonlinear domains (2019)
Bueno, Thiago Pereira; Barros, Leliane Nunes de ; Mauá, Denis Deratani ; Sanner, Scott
Source: Proceedings. Conference titles: AAAI Conference on Artificial Intelligence. Unidade: IME
Assunto: APRENDIZADO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BUENO, Thiago Pereira et al. Deep reactive policies for planning in stochastic nonlinear domains. 2019, Anais.. Palo Alto: AAAI, 2019. Disponível em: https://doi.org/10.1609/aaai.v33i01.33017530. Acesso em: 29 maio 2024.
APA
Bueno, T. P., Barros, L. N. de, Mauá, D. D., & Sanner, S. (2019). Deep reactive policies for planning in stochastic nonlinear domains. In Proceedings. Palo Alto: AAAI. doi:10.1609/aaai.v33i01.33017530
NLM
Bueno TP, Barros LN de, Mauá DD, Sanner S. Deep reactive policies for planning in stochastic nonlinear domains [Internet]. Proceedings. 2019 ;[citado 2024 maio 29 ] Available from: https://doi.org/10.1609/aaai.v33i01.33017530
Vancouver
Bueno TP, Barros LN de, Mauá DD, Sanner S. Deep reactive policies for planning in stochastic nonlinear domains [Internet]. Proceedings. 2019 ;[citado 2024 maio 29 ] Available from: https://doi.org/10.1609/aaai.v33i01.33017530
Trabalho de evento
Belief change and non-monotonic reasoning sans compactness (2019)
Ribeiro, Jandson S ; Nayak, Abhaya ; Wassermann, Renata
Source: Proceedings. Conference titles: AAAI Conference on Artificial Intelligence. Unidade: IME
Subjects: LÓGICA MATEMÁTICA, SEMÂNTICA DE PROGRAMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RIBEIRO, Jandson S e NAYAK, Abhaya e WASSERMANN, Renata. Belief change and non-monotonic reasoning sans compactness. 2019, Anais.. Palo Alto: AAAI, 2019. Disponível em: https://doi.org/10.1609/aaai.v33i01.33013019. Acesso em: 29 maio 2024.
APA
Ribeiro, J. S., Nayak, A., & Wassermann, R. (2019). Belief change and non-monotonic reasoning sans compactness. In Proceedings. Palo Alto: AAAI. doi:10.1609/aaai.v33i01.33013019
NLM
Ribeiro JS, Nayak A, Wassermann R. Belief change and non-monotonic reasoning sans compactness [Internet]. Proceedings. 2019 ;[citado 2024 maio 29 ] Available from: https://doi.org/10.1609/aaai.v33i01.33013019
Vancouver
Ribeiro JS, Nayak A, Wassermann R. Belief change and non-monotonic reasoning sans compactness [Internet]. Proceedings. 2019 ;[citado 2024 maio 29 ] Available from: https://doi.org/10.1609/aaai.v33i01.33013019
Trabalho de evento
Evolving action abstractions for real-time planning in extensive-form games (2019)
Mariño, Julian Ricardo Hernandez ; Moraes, Rubens O; Toledo, Claudio Fabiano Motta ; Lelis, Levi H. S
Source: Proceedings. Conference titles: AAAI Conference on Artificial Intelligence. Unidade: ICMC
Subjects: JOGOS DE COMPUTADOR, TEMPO-REAL, ABSTRAÇÃO, ALGORITMOS ÚTEIS E ESPECÍFICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MARIÑO, Julian Ricardo Hernandez et al. Evolving action abstractions for real-time planning in extensive-form games. 2019, Anais.. Palo Alto: AAAI Press, 2019. Disponível em: https://doi.org/10.1609/aaai.v33i01.33012330. Acesso em: 29 maio 2024.
APA
Mariño, J. R. H., Moraes, R. O., Toledo, C. F. M., & Lelis, L. H. S. (2019). Evolving action abstractions for real-time planning in extensive-form games. In Proceedings. Palo Alto: AAAI Press. doi:10.1609/aaai.v33i01.33012330
NLM
Mariño JRH, Moraes RO, Toledo CFM, Lelis LHS. Evolving action abstractions for real-time planning in extensive-form games [Internet]. Proceedings. 2019 ;[citado 2024 maio 29 ] Available from: https://doi.org/10.1609/aaai.v33i01.33012330
Vancouver
Mariño JRH, Moraes RO, Toledo CFM, Lelis LHS. Evolving action abstractions for real-time planning in extensive-form games [Internet]. Proceedings. 2019 ;[citado 2024 maio 29 ] Available from: https://doi.org/10.1609/aaai.v33i01.33012330
Trabalho de evento-anais periodico
Algorithms for deciding counting quantifiers over unary predicates (2017)
Finger, Marcelo ; De Bona, Glauber
Source: Proceedings. Conference titles: AAAI Conference on Artificial Intelligence. Unidades: IME, EP
Assunto: LÓGICA MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo e DE BONA, Glauber. Algorithms for deciding counting quantifiers over unary predicates. Proceedings. Palo Alto: AAAI Publications. Disponível em: https://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14515/14113. Acesso em: 29 maio 2024. , 2017
APA
Finger, M., & De Bona, G. (2017). Algorithms for deciding counting quantifiers over unary predicates. Proceedings. Palo Alto: AAAI Publications. Recuperado de https://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14515/14113
NLM
Finger M, De Bona G. Algorithms for deciding counting quantifiers over unary predicates [Internet]. Proceedings. 2017 ;[citado 2024 maio 29 ] Available from: https://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14515/14113
Vancouver
Finger M, De Bona G. Algorithms for deciding counting quantifiers over unary predicates [Internet]. Proceedings. 2017 ;[citado 2024 maio 29 ] Available from: https://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14515/14113
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: 29 maio 2024.
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 2024 maio 29 ] 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 2024 maio 29 ] Available from: http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9312
Trabalho de evento
Real-time symbolic dynamic programming for hybrid MDPs (2015)
Vianna, Luis Gustavo Rocha; Barros, Leliane Nunes de ; Sanner, Scott
Source: Proceedings. Conference titles: AAAI Conference on Artificial Intelligence. Unidade: IME
Subjects: PROCESSOS DE MARKOV, PROGRAMAÇÃO DINÂMICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VIANNA, Luis Gustavo Rocha e BARROS, Leliane Nunes de e SANNER, Scott. Real-time symbolic dynamic programming for hybrid MDPs. 2015, Anais.. Palo Alto: AAAI, 2015. Disponível em: http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9701. Acesso em: 29 maio 2024.
APA
Vianna, L. G. R., Barros, L. N. de, & Sanner, S. (2015). Real-time symbolic dynamic programming for hybrid MDPs. In Proceedings. Palo Alto: AAAI. Recuperado de http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9701
NLM
Vianna LGR, Barros LN de, Sanner S. Real-time symbolic dynamic programming for hybrid MDPs [Internet]. Proceedings. 2015 ;[citado 2024 maio 29 ] Available from: http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9701
Vancouver
Vianna LGR, Barros LN de, Sanner S. Real-time symbolic dynamic programming for hybrid MDPs [Internet]. Proceedings. 2015 ;[citado 2024 maio 29 ] Available from: http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9701
Trabalho de evento
Complexity of inferences in polytree-shaped semi-qualitative probabilistic networks (2013)
Campos, Cassio Polpo de; Cozman, Fabio Gagliardi
Source: Proceedings. Conference titles: AAAI Conference on Artificial Intelligence. Unidade: EP
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPOS, Cassio Polpo de e COZMAN, Fabio Gagliardi. Complexity of inferences in polytree-shaped semi-qualitative probabilistic networks. 2013, Anais.. San Francisco: AAAI, 2013. Disponível em: https://repositorio.usp.br/directbitstream/beff8521-2d0c-4770-b720-196853d9f9f5/Cozman-2013-Complexity%20of%20inferences%20in%20polytree%20shaped%20semi%20qualitative%20ok.pdf. Acesso em: 29 maio 2024.
APA
Campos, C. P. de, & Cozman, F. G. (2013). Complexity of inferences in polytree-shaped semi-qualitative probabilistic networks. In Proceedings. San Francisco: AAAI. Recuperado de https://repositorio.usp.br/directbitstream/beff8521-2d0c-4770-b720-196853d9f9f5/Cozman-2013-Complexity%20of%20inferences%20in%20polytree%20shaped%20semi%20qualitative%20ok.pdf
NLM
Campos CP de, Cozman FG. Complexity of inferences in polytree-shaped semi-qualitative probabilistic networks [Internet]. Proceedings. 2013 ;[citado 2024 maio 29 ] Available from: https://repositorio.usp.br/directbitstream/beff8521-2d0c-4770-b720-196853d9f9f5/Cozman-2013-Complexity%20of%20inferences%20in%20polytree%20shaped%20semi%20qualitative%20ok.pdf
Vancouver
Campos CP de, Cozman FG. Complexity of inferences in polytree-shaped semi-qualitative probabilistic networks [Internet]. Proceedings. 2013 ;[citado 2024 maio 29 ] Available from: https://repositorio.usp.br/directbitstream/beff8521-2d0c-4770-b720-196853d9f9f5/Cozman-2013-Complexity%20of%20inferences%20in%20polytree%20shaped%20semi%20qualitative%20ok.pdf

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Subjects

Funding Agencies