ReP USP - Resultado da busca

Trabalho de evento-anais periodico
A framework to generate synthetic multi-label datasets (2014)
Tomás, Jimena Torres; Spolaôr, Newton; Cherman, Everton Alvares; Monard, Maria Carolina
Fonte: Electronic Notes in Theoretical Computer Science. Nome do evento: Latin American Computing Conference - CLEI. Unidade: ICMC
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TOMÁS, Jimena Torres et al. A framework to generate synthetic multi-label datasets. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.entcs.2014.01.025. Acesso em: 29 nov. 2025. , 2014
APA
Tomás, J. T., Spolaôr, N., Cherman, E. A., & Monard, M. C. (2014). A framework to generate synthetic multi-label datasets. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. doi:10.1016/j.entcs.2014.01.025
NLM
Tomás JT, Spolaôr N, Cherman EA, Monard MC. A framework to generate synthetic multi-label datasets [Internet]. Electronic Notes in Theoretical Computer Science. 2014 ; fe 2014 155-176.[citado 2025 nov. 29 ] Available from: https://doi.org/10.1016/j.entcs.2014.01.025
Vancouver
Tomás JT, Spolaôr N, Cherman EA, Monard MC. A framework to generate synthetic multi-label datasets [Internet]. Electronic Notes in Theoretical Computer Science. 2014 ; fe 2014 155-176.[citado 2025 nov. 29 ] Available from: https://doi.org/10.1016/j.entcs.2014.01.025
Trabalho de evento-anais periodico
A comparison of multi-label feature selection methods using the problem transformation approach (2013)
Spolaôr, Newton; Cherman, Everton Alvares; Monard, Maria Carolina ; Lee, Huei Diana
Fonte: Electronic Notes in Theoretical Computer Science. Nome do evento: Latin American Conference in Informatics - CLEI. Unidade: ICMC
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SPOLAÔR, Newton et al. A comparison of multi-label feature selection methods using the problem transformation approach. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.entcs.2013.02.010. Acesso em: 29 nov. 2025. , 2013
APA
Spolaôr, N., Cherman, E. A., Monard, M. C., & Lee, H. D. (2013). A comparison of multi-label feature selection methods using the problem transformation approach. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. doi:10.1016/j.entcs.2013.02.010
NLM
Spolaôr N, Cherman EA, Monard MC, Lee HD. A comparison of multi-label feature selection methods using the problem transformation approach [Internet]. Electronic Notes in Theoretical Computer Science. 2013 ; 292( 5): 135-151.[citado 2025 nov. 29 ] Available from: https://doi.org/10.1016/j.entcs.2013.02.010
Vancouver
Spolaôr N, Cherman EA, Monard MC, Lee HD. A comparison of multi-label feature selection methods using the problem transformation approach [Internet]. Electronic Notes in Theoretical Computer Science. 2013 ; 292( 5): 135-151.[citado 2025 nov. 29 ] Available from: https://doi.org/10.1016/j.entcs.2013.02.010
Trabalho de evento-anais periodico
Towards an efficient prover for the C1 paraconsistent logic (2009)
Neto, Adolfo ; Kaestner, Celso A. A.; Finger, Marcelo
Fonte: Electronic Notes in Theoretical Computer Science. Nome do evento: Workshop on Logical and Semantic Frameworks, with Applications - LSFA. Unidade: IME
Assuntos: LÓGICA FORMAL, WEB SEMÂNTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NETO, Adolfo e KAESTNER, Celso A. A. e FINGER, Marcelo. Towards an efficient prover for the C1 paraconsistent logic. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.entcs.2009.11.007. Acesso em: 29 nov. 2025. , 2009
APA
Neto, A., Kaestner, C. A. A., & Finger, M. (2009). Towards an efficient prover for the C1 paraconsistent logic. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. doi:10.1016/j.entcs.2009.11.007
NLM
Neto A, Kaestner CAA, Finger M. Towards an efficient prover for the C1 paraconsistent logic [Internet]. Electronic Notes in Theoretical Computer Science. 2009 ; 256 87-102.[citado 2025 nov. 29 ] Available from: https://doi.org/10.1016/j.entcs.2009.11.007
Vancouver
Neto A, Kaestner CAA, Finger M. Towards an efficient prover for the C1 paraconsistent logic [Internet]. Electronic Notes in Theoretical Computer Science. 2009 ; 256 87-102.[citado 2025 nov. 29 ] Available from: https://doi.org/10.1016/j.entcs.2009.11.007
Trabalho de evento-anais periodico
Model checking merged program traces (2009)
Silva, Paulo Salem da; Melo, Ana Cristina Vieira de
Fonte: Electronic Notes in Theoretical Computer Science. Nome do evento: Brazilian Symposium on Formal Methods - SBMF. Unidade: IME
Assuntos: JAVA, MODELOS DE PROCESSO DE SOFTWARE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Paulo Salem da e MELO, Ana Cristina Vieira de. Model checking merged program traces. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.entcs.2009.05.047. Acesso em: 29 nov. 2025. , 2009
APA
Silva, P. S. da, & Melo, A. C. V. de. (2009). Model checking merged program traces. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. doi:10.1016/j.entcs.2009.05.047
NLM
Silva PS da, Melo ACV de. Model checking merged program traces [Internet]. Electronic Notes in Theoretical Computer Science. 2009 ; 240 97-112.[citado 2025 nov. 29 ] Available from: https://doi.org/10.1016/j.entcs.2009.05.047
Vancouver
Silva PS da, Melo ACV de. Model checking merged program traces [Internet]. Electronic Notes in Theoretical Computer Science. 2009 ; 240 97-112.[citado 2025 nov. 29 ] Available from: https://doi.org/10.1016/j.entcs.2009.05.047
Trabalho de evento-anais periodico
Using abduction to compute efficient proofs (2009)
Finger, Marcelo
Fonte: Electronic Notes in Theoretical Computer Science. Nome do evento: Workshop on Logical and Semantic Frameworks, with Applications - LSFA. Unidade: IME
Assunto: LÓGICA FORMAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo. Using abduction to compute efficient proofs. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.entcs.2009.07.047. Acesso em: 29 nov. 2025. , 2009
APA
Finger, M. (2009). Using abduction to compute efficient proofs. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. doi:10.1016/j.entcs.2009.07.047
NLM
Finger M. Using abduction to compute efficient proofs [Internet]. Electronic Notes in Theoretical Computer Science. 2009 ; 247 39-49.[citado 2025 nov. 29 ] Available from: https://doi.org/10.1016/j.entcs.2009.07.047
Vancouver
Finger M. Using abduction to compute efficient proofs [Internet]. Electronic Notes in Theoretical Computer Science. 2009 ; 247 39-49.[citado 2025 nov. 29 ] Available from: https://doi.org/10.1016/j.entcs.2009.07.047

Unidades USP

ReP

Filtros

Autores