Zobrazeno 1 - 10
of 100
pro vyhledávání: '"Rubens, O"'
Autor:
Moraes, Rubens O., Lelis, Levi H. S.
Syntax-guided synthesis is commonly used to generate programs encoding policies. In this approach, the set of programs, that can be written in a domain-specific language defines the search space, and an algorithm searches within this space for progra
Externí odkaz:
http://arxiv.org/abs/2405.05431
Neural models are one of the most popular approaches for music generation, yet there aren't standard large datasets tailored for learning music directly from game data. To address this research gap, we introduce a novel dataset named NES-VMDB, contai
Externí odkaz:
http://arxiv.org/abs/2404.04420
This paper introduces Local Learner (2L), an algorithm for providing a set of reference strategies to guide the search for programmatic strategies in two-player zero-sum games. Previous learning algorithms, such as Iterated Best Response (IBR), Ficti
Externí odkaz:
http://arxiv.org/abs/2307.04893
Autor:
Moraes, Rubens O., Lelis, Levi H. S.
Action abstractions restrict the number of legal actions available during search in multi-unit real-time adversarial games, thus allowing algorithms to focus their search on a set of promising actions. Optimal strategies derived from un-abstracted sp
Externí odkaz:
http://arxiv.org/abs/1711.08101
Autor:
VANESSA S. PETRY, VALDIR M. STEFENON, LILIAN O. MACHADO, NEWTON C.F. DA COSTA, GUSTAVO H.F. KLABUNDE, RUBENS O. NODARI
Publikováno v:
Anais da Academia Brasileira de Ciências, Vol 93, Iss suppl 3 (2021)
Abstract Campomanesia xanthocarpa (Mart.) O. Berg is a South American fruit tree species with important ecological and medicinal properties, which remnants are currently found mainly in isolated forest fragments. In this study, SSR markers from three
Externí odkaz:
https://doaj.org/article/baee547f130b49f28f0f68dfb5b60df1
Autor:
de Santana Lopes, Amanda, Pacheco, Túlio Gomes, Nimz, Tabea, Vieira, Leila do Nascimento, Guerra, Miguel P., Nodari, Rubens O., de Souza, Emanuel Maltempi, de Oliveira Pedrosa, Fábio, Rogalski, Marcelo
Publikováno v:
Planta, 2018 Apr 01. 247(4), 1011-1030.
Externí odkaz:
https://www.jstor.org/stable/48726906
Publikováno v:
Journal of Artificial Intelligence Research. 75:1103-1137
Action abstractions restrict the number of legal actions available for real-time planning in zero-sum extensive-form games, thus allowing algorithms to focus their search on a set of promising actions. Even though unabstracted game trees can lead to
Autor:
Fernando D. Sánchez-Mora, Luciano Saifert, Jean Zanghelini, Wilson T. Assumpção, Cláudia A. Guginski-Piva, Renan Giacomet, Eduardo I. Novak, Gustavo H. Klabunde, Rudolf Eibach, Lirio Dal Vesco, Rubens O. Nodari, Leocir J. Welter
Publikováno v:
Crop Breeding and Applied Biotechnology, Vol 17, Iss 2, Pp 141-149 (2017)
Downy mildew (Plasmopara viticola) is the main grapevine disease in humid regions. In the present investigation, marker-assisted selection (MAS) was used to develop grapevine lines homozygous in loci Rpv1 and Rpv3 for resistance against P. viticola.
Externí odkaz:
https://doaj.org/article/c2103d266a7641a3aff03aebd1b3be14
Autor:
Gustavo H.F. Klabunde, Camila F.O. Junkes, Sarah Z.A. Tenfen, Adriana C.M. Dantas, Carla R.C. Furlan, Adelar Mantovani, Frederico Denardi, José I. Bonet, Rubens O. Nodari
Publikováno v:
Crop Breeding and Applied Biotechnology, Vol 16, Iss 3, Pp 189-196 (2016)
Among the cultivation problems of apple production in Brazil, Apple Leaf Spot (ALS) disease represents one of the main breeding challenges. This study aims at analyzing the genetic diversity among 152 apple scion accessions available at the Apple Gen
Externí odkaz:
https://doaj.org/article/4754faf56ada499884259c16e76ae110
Autor:
Julian R. H. Mariño, Rubens O. Moraes, Tassiana C. Oliveira, Claudio Toledo, Levi H. S. Lelis
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 35:381-389
Search-based systems have shown to be effective for planning in zero-sum games. However, search-based approaches have important disadvantages. First, the decisions of search algorithms are mostly non-interpretable, which is problematic in domains whe