Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Reginaldo Inojosa da Silva Filho"'
Publikováno v:
Biblioteca Digital de Teses e Dissertações da USPUniversidade de São PauloUSP.
O objetivo deste trabalho é apresentar o modelo dos autômatos adaptativos de segunda ordem e mostrar a forte conexão desse modelo com o aprendizado indutivo no limite. Tal modelo é definido com a utilização de um conjunto de transformações so
Publikováno v:
Biblioteca Digital de Teses e Dissertações da USPUniversidade de São PauloUSP.
Este trabalho introduz a definição de Sistemas Genéricos para Diagnóstico de Falhas, os conceitos envolvidos, e a sua utilização na manutenção de equipamentos de aplicação crítica em importantes setores industriais tais como a aeronáutica
Publikováno v:
Computational Science and Its Applications – ICCSA 2020 ISBN: 9783030588137
ICCSA (5)
ICCSA (5)
We present in this article, for the area of structural and functional genetics, a preliminary theoretical model based on the representation of transcriptomes and proteomes as families of formal languages, in which the phenomenon of translation is des
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac0a96918f10006f59aaefd0fb1a12bb
https://doi.org/10.1007/978-3-030-58814-4_60
https://doi.org/10.1007/978-3-030-58814-4_60
Publikováno v:
BRACIS
the aim of this work is to present an initial investigation about the possibilities of using the Biomechanical Turing Machine (BTM) as a therapy tool for prostate cancer, using the RNA expression as input and drug liberation scheme as output.
Autor:
Reginaldo Inojosa da Silva Filho, Ricardo Luis de Azevedo da Rocha, Ricardo Henrique Gracini Guiraldelli
Publikováno v:
Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence ISBN: 9783642449574
Algorithmic Probability and Friends
Algorithmic Probability and Friends
The purpose of this work is to show the strong connection between learning in the limit and the second-order adaptive automaton. The connection is established using the mutating programs approach, in which any hypothesis can be used to start a learni
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d5a3548ea4bf55d7dc72618fd44959a
https://doi.org/10.1007/978-3-642-44958-1_8
https://doi.org/10.1007/978-3-642-44958-1_8
Publikováno v:
Adaptive and Natural Computing Algorithms ISBN: 9783642202667
ICANNGA (2)
ICANNGA (2)
The purpose is to present a new and better representation for the adaptive finite automaton and to also show that both formulations - the original and the newly created - have the same computational power. Adaptive finite automaton original formulati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6060f72f5993b1244786734b883e2e4a
https://doi.org/10.1007/978-3-642-20267-4_29
https://doi.org/10.1007/978-3-642-20267-4_29