Frontiers of combining systems: 11th International Symposium, FroCoS 2017, Brasília, Brazil, September 27-29, 2017, Proceedings (2017)
- Autores:
- Autor USP: FINGER, MARCELO - IME
- Unidade: IME
- DOI: 10.1007/978-3-319-66167-4
- Assuntos: CIÊNCIA DA COMPUTAÇÃO; ENGENHARIA DE SOFTWARE; INTELIGÊNCIA ARTIFICIAL
- Idioma: Inglês
- Imprenta:
- Editora: Springer International Publishing
- Local: Cham
- Data de publicação: 2017
- ISBN: 9783319661667
- Nome do evento: International Symposium - FroCoS 2017
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: green
- Licença: cc-by
-
ABNT
Frontiers of combining systems: 11th International Symposium, FroCoS 2017, Brasília, Brazil, September 27-29, 2017, Proceedings. . Cham: Springer International Publishing. Disponível em: https://doi.org/10.1007/978-3-319-66167-4. Acesso em: 23 abr. 2024. , 2017 -
APA
Frontiers of combining systems: 11th International Symposium, FroCoS 2017, Brasília, Brazil, September 27-29, 2017, Proceedings. (2017). Frontiers of combining systems: 11th International Symposium, FroCoS 2017, Brasília, Brazil, September 27-29, 2017, Proceedings. Cham: Springer International Publishing. doi:10.1007/978-3-319-66167-4 -
NLM
Frontiers of combining systems: 11th International Symposium, FroCoS 2017, Brasília, Brazil, September 27-29, 2017, Proceedings [Internet]. 2017 ;[citado 2024 abr. 23 ] Available from: https://doi.org/10.1007/978-3-319-66167-4 -
Vancouver
Frontiers of combining systems: 11th International Symposium, FroCoS 2017, Brasília, Brazil, September 27-29, 2017, Proceedings [Internet]. 2017 ;[citado 2024 abr. 23 ] Available from: https://doi.org/10.1007/978-3-319-66167-4 - Técnicas de otimização da precisão empregadas no etiquetador Tycho Brahe
- Concurrency control for perceivedly instantaneous transactions in valid-time databases
- Resource use pattern analysis for predicting resource availability in opportunistic grids
- Completeness for cut-based abduction
- On the predictability of classical propositional logic
- Automated classification of pathology reports
- Minimal axiomatizations and algebraic rings: a conjectured relationship
- Towards an efficient prover for the C1 paraconsistent logic
- Computational solutions for structural constraints: learning structural permissions in categorial grammar
- Towards polynomial approximations of full propositional logic
Informações sobre o DOI: 10.1007/978-3-319-66167-4 (Fonte: oaDOI API)
Como citar
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
