ReP USP - Resultado da busca

Artigo de periodico
An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times (2023)
Almeida, Fernando Siqueira de ; Nagano, Marcelo Seido
Source: 4OR - A Quarterly Journal of Operations Research. Unidade: EESC
Subjects: ALGORITMOS, SEQUENCIAÇÃO DA PRODUÇÃO, ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALMEIDA, Fernando Siqueira de e NAGANO, Marcelo Seido. An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times. 4OR - A Quarterly Journal of Operations Research, p. 1-15, 2023Tradução . . Disponível em: https://doi.org/10.1007/s10288-023-00535-7. Acesso em: 17 nov. 2024.
APA
Almeida, F. S. de, & Nagano, M. S. (2023). An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times. 4OR - A Quarterly Journal of Operations Research, 1-15. doi:10.1007/s10288-023-00535-7
NLM
Almeida FS de, Nagano MS. An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times [Internet]. 4OR - A Quarterly Journal of Operations Research. 2023 ; 1-15.[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/s10288-023-00535-7
Vancouver
Almeida FS de, Nagano MS. An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times [Internet]. 4OR - A Quarterly Journal of Operations Research. 2023 ; 1-15.[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/s10288-023-00535-7
Trabalho de evento-anais periodico
Extreme learning machine to graph convolutional networks (2022)
Gonçalves, Thales ; Rodrigues, Francisco Aparecido
Source: Lecture Notes in Artificial Intelligence. Conference titles: Brazilian Conference on Intelligent Systems - BRACIS. Unidade: ICMC
Subjects: APRENDIZADO COMPUTACIONAL, REDES COMPLEXAS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GONÇALVES, Thales e RODRIGUES, Francisco Aparecido. Extreme learning machine to graph convolutional networks. Lecture Notes in Artificial Intelligence. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-031-21689-3_42. Acesso em: 17 nov. 2024. , 2022
APA
Gonçalves, T., & Rodrigues, F. A. (2022). Extreme learning machine to graph convolutional networks. Lecture Notes in Artificial Intelligence. Cham: Springer. doi:10.1007/978-3-031-21689-3_42
NLM
Gonçalves T, Rodrigues FA. Extreme learning machine to graph convolutional networks [Internet]. Lecture Notes in Artificial Intelligence. 2022 ; 13654 601-615.[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-031-21689-3_42
Vancouver
Gonçalves T, Rodrigues FA. Extreme learning machine to graph convolutional networks [Internet]. Lecture Notes in Artificial Intelligence. 2022 ; 13654 601-615.[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-031-21689-3_42
Trabalho de evento-anais periodico
Learning to reuse: adaptive model learning for evolving systems (2019)
Damasceno, Carlos Diego Nascimento ; Mousavi, Mohammad Reza ; Simão, Adenilso da Silva
Source: Lecture Notes in Computer Science - LNCS. Conference titles: International Conference on Integrated Formal Methods - IFM. Unidade: ICMC
Subjects: APRENDIZADO COMPUTACIONAL, ALGORITMOS, REÚSO DE SOFTWARE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DAMASCENO, Carlos Diego Nascimento e MOUSAVI, Mohammad Reza e SIMÃO, Adenilso da Silva. Learning to reuse: adaptive model learning for evolving systems. Lecture Notes in Computer Science - LNCS. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-030-34968-4_8. Acesso em: 17 nov. 2024. , 2019
APA
Damasceno, C. D. N., Mousavi, M. R., & Simão, A. da S. (2019). Learning to reuse: adaptive model learning for evolving systems. Lecture Notes in Computer Science - LNCS. Cham: Springer. doi:10.1007/978-3-030-34968-4_8
NLM
Damasceno CDN, Mousavi MR, Simão A da S. Learning to reuse: adaptive model learning for evolving systems [Internet]. Lecture Notes in Computer Science - LNCS. 2019 ; 11918 138-156.[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-030-34968-4_8
Vancouver
Damasceno CDN, Mousavi MR, Simão A da S. Learning to reuse: adaptive model learning for evolving systems [Internet]. Lecture Notes in Computer Science - LNCS. 2019 ; 11918 138-156.[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-030-34968-4_8
Trabalho de evento-anais periodico
Prediction of interpersonal help-seeking behavior from log files in an in-service education distance course (2018)
Penteado, Bruno Elias; Isotani, Seiji ; Paiva, Paula M; Morettin-Zupelari, Marina; Ferrari, Deborah Viviane
Source: Lecture Notes in Computer Science. Conference titles: International Conference on Artificial Intelligence in Education - AIED. Unidades: ICMC, FOB
Subjects: APRENDIZADO COMPUTACIONAL, ALGORITMOS, ENSINO E APRENDIZAGEM, EDUCAÇÃO A DISTÂNCIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PENTEADO, Bruno Elias et al. Prediction of interpersonal help-seeking behavior from log files in an in-service education distance course. Lecture Notes in Computer Science. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-319-93846-2_49. Acesso em: 17 nov. 2024. , 2018
APA
Penteado, B. E., Isotani, S., Paiva, P. M., Morettin-Zupelari, M., & Ferrari, D. V. (2018). Prediction of interpersonal help-seeking behavior from log files in an in-service education distance course. Lecture Notes in Computer Science. Cham: Springer. doi:10.1007/978-3-319-93846-2_49
NLM
Penteado BE, Isotani S, Paiva PM, Morettin-Zupelari M, Ferrari DV. Prediction of interpersonal help-seeking behavior from log files in an in-service education distance course [Internet]. Lecture Notes in Computer Science. 2018 ; 10948 266-270.[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-319-93846-2_49
Vancouver
Penteado BE, Isotani S, Paiva PM, Morettin-Zupelari M, Ferrari DV. Prediction of interpersonal help-seeking behavior from log files in an in-service education distance course [Internet]. Lecture Notes in Computer Science. 2018 ; 10948 266-270.[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-319-93846-2_49
Parte de monografia/livro
Optimal allocation of automatic reclosers (2018)
Almeida, Carlos Frederico Meschini ; Quiroga, Gabriel Albieri; Kagan, Henrique; Kagan, Nelson
Source: Electric Distribution Network Planning. Unidade: EP
Subjects: PLANEJAMENTO ENERGÉTICO, DISTRIBUIÇÃO DE ENERGIA ELÉTRICA, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALMEIDA, Carlos Frederico Meschini et al. Optimal allocation of automatic reclosers. Electric Distribution Network Planning. Tradução . Singapura: Springer, 2018. . Disponível em: https://doi.org/10.1007/978-981-10-7056-3_13. Acesso em: 17 nov. 2024.
APA
Almeida, C. F. M., Quiroga, G. A., Kagan, H., & Kagan, N. (2018). Optimal allocation of automatic reclosers. In Electric Distribution Network Planning. Singapura: Springer. doi:10.1007/978-981-10-7056-3_13
NLM
Almeida CFM, Quiroga GA, Kagan H, Kagan N. Optimal allocation of automatic reclosers [Internet]. In: Electric Distribution Network Planning. Singapura: Springer; 2018. [citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-981-10-7056-3_13
Vancouver
Almeida CFM, Quiroga GA, Kagan H, Kagan N. Optimal allocation of automatic reclosers [Internet]. In: Electric Distribution Network Planning. Singapura: Springer; 2018. [citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-981-10-7056-3_13
Trabalho de evento-anais periodico
On the support of the similarity-aware division operator in a commercial RDBMS (2018)
Vasconcelos, Guilherme Q; Kaster, Daniel S; Cordeiro, Robson Leonardo Ferreira
Source: Lecture Notes in Computer Science. Conference titles: European Conference on Advances in Databases and Information Systems - ADBIS. Unidade: ICMC
Subjects: GERENCIADORES DE BANCO DE DADOS, RECONHECIMENTO DE PADRÕES, ALGORITMOS, SQL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VASCONCELOS, Guilherme Q e KASTER, Daniel S e CORDEIRO, Robson Leonardo Ferreira. On the support of the similarity-aware division operator in a commercial RDBMS. Lecture Notes in Computer Science. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-319-98398-1_10. Acesso em: 17 nov. 2024. , 2018
APA
Vasconcelos, G. Q., Kaster, D. S., & Cordeiro, R. L. F. (2018). On the support of the similarity-aware division operator in a commercial RDBMS. Lecture Notes in Computer Science. Cham: Springer. doi:10.1007/978-3-319-98398-1_10
NLM
Vasconcelos GQ, Kaster DS, Cordeiro RLF. On the support of the similarity-aware division operator in a commercial RDBMS [Internet]. Lecture Notes in Computer Science. 2018 ; 11019 142-155.[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-319-98398-1_10
Vancouver
Vasconcelos GQ, Kaster DS, Cordeiro RLF. On the support of the similarity-aware division operator in a commercial RDBMS [Internet]. Lecture Notes in Computer Science. 2018 ; 11019 142-155.[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-319-98398-1_10
Trabalho de evento-anais periodico
Effects of random sampling on SVM hyper-parameter tuning (2017)
Horváth, Tomás; Mantovani, Rafael G; Carvalho, André Carlos Ponce de Leon Ferreira de
Source: Advances in Intelligent Systems and Computing. Conference titles: International Conference on Intelligent Systems Design and Applications - ISDA. Unidade: ICMC
Subjects: APRENDIZADO COMPUTACIONAL, MINERAÇÃO DE DADOS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HORVÁTH, Tomás e MANTOVANI, Rafael G e CARVALHO, André Carlos Ponce de Leon Ferreira de. Effects of random sampling on SVM hyper-parameter tuning. Advances in Intelligent Systems and Computing. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-319-53480-0_27. Acesso em: 17 nov. 2024. , 2017
APA
Horváth, T., Mantovani, R. G., & Carvalho, A. C. P. de L. F. de. (2017). Effects of random sampling on SVM hyper-parameter tuning. Advances in Intelligent Systems and Computing. Cham: Springer. doi:10.1007/978-3-319-53480-0_27
NLM
Horváth T, Mantovani RG, Carvalho ACP de LF de. Effects of random sampling on SVM hyper-parameter tuning [Internet]. Advances in Intelligent Systems and Computing. 2017 ; 557 268-278.[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-319-53480-0_27
Vancouver
Horváth T, Mantovani RG, Carvalho ACP de LF de. Effects of random sampling on SVM hyper-parameter tuning [Internet]. Advances in Intelligent Systems and Computing. 2017 ; 557 268-278.[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-319-53480-0_27
Trabalho de evento
Seed robustness of oriented image foresting transform: core computation and the robustness coefficient (2017)
Tavares, Anderson Carlos Moreira; Bejar, Hans Harley Ccacyahuillca; Miranda, Paulo André Vechiatto de
Source: Mathematical Morphology and Its Applications to Signal and Image Processing: Proceedings. Conference titles: International Symposium on Mathematical Morphology and Its Applications to Signal and Image Processing -ISMM. Unidade: IME
Subjects: INFORMÁTICA MÉDICA, PROCESSAMENTO DE IMAGENS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TAVARES, Anderson Carlos Moreira e BEJAR, Hans Harley Ccacyahuillca e MIRANDA, Paulo André Vechiatto de. Seed robustness of oriented image foresting transform: core computation and the robustness coefficient. 2017, Anais.. Cham: Springer, 2017. Disponível em: https://doi.org/10.1007/978-3-319-57240-6_10. Acesso em: 17 nov. 2024.
APA
Tavares, A. C. M., Bejar, H. H. C., & Miranda, P. A. V. de. (2017). Seed robustness of oriented image foresting transform: core computation and the robustness coefficient. In Mathematical Morphology and Its Applications to Signal and Image Processing: Proceedings. Cham: Springer. doi:10.1007/978-3-319-57240-6_10
NLM
Tavares ACM, Bejar HHC, Miranda PAV de. Seed robustness of oriented image foresting transform: core computation and the robustness coefficient [Internet]. Mathematical Morphology and Its Applications to Signal and Image Processing: Proceedings. 2017 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-319-57240-6_10
Vancouver
Tavares ACM, Bejar HHC, Miranda PAV de. Seed robustness of oriented image foresting transform: core computation and the robustness coefficient [Internet]. Mathematical Morphology and Its Applications to Signal and Image Processing: Proceedings. 2017 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-319-57240-6_10
Parte de monografia/livro
Efficient hill-climber for multi-objective pseudo-Boolean optimization (2016)
Chicano, Francisco; Whitley, Darrell; Tinós, Renato
Source: Evolutionary computation in combinatorial optimization. Unidade: FFCLRP
Subjects: ALGORITMOS, OTIMIZAÇÃO MATEMÁTICA, COMPUTAÇÃO EVOLUTIVA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CHICANO, Francisco e WHITLEY, Darrell e TINÓS, Renato. Efficient hill-climber for multi-objective pseudo-Boolean optimization. Evolutionary computation in combinatorial optimization. Tradução . New York: Springer, 2016. p. 267 . Disponível em: https://doi.org/10.1007/978-3-319-30698-8. Acesso em: 17 nov. 2024.
APA
Chicano, F., Whitley, D., & Tinós, R. (2016). Efficient hill-climber for multi-objective pseudo-Boolean optimization. In Evolutionary computation in combinatorial optimization (p. 267 ). New York: Springer. doi:10.1007/978-3-319-30698-8
NLM
Chicano F, Whitley D, Tinós R. Efficient hill-climber for multi-objective pseudo-Boolean optimization [Internet]. In: Evolutionary computation in combinatorial optimization. New York: Springer; 2016. p. 267 .[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-319-30698-8
Vancouver
Chicano F, Whitley D, Tinós R. Efficient hill-climber for multi-objective pseudo-Boolean optimization [Internet]. In: Evolutionary computation in combinatorial optimization. New York: Springer; 2016. p. 267 .[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-319-30698-8
Trabalho de evento
A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem (2015)
Ravelo, Santiago Valdés; Ferreira, Carlos Eduardo
Source: Algorithms and Discrete Applied Mathematics: First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings. Conference titles: International Conference on Algorithms and Discrete Applied Mathematics - CALDAM. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS, MATEMÁTICA DISCRETA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RAVELO, Santiago Valdés e FERREIRA, Carlos Eduardo. A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem. 2015, Anais.. Cham: Springer, 2015. Disponível em: https://doi.org/10.1007/978-3-319-14974-5_2. Acesso em: 17 nov. 2024.
APA
Ravelo, S. V., & Ferreira, C. E. (2015). A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem. In Algorithms and Discrete Applied Mathematics: First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings. Cham: Springer. doi:10.1007/978-3-319-14974-5_2
NLM
Ravelo SV, Ferreira CE. A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem [Internet]. Algorithms and Discrete Applied Mathematics: First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings. 2015 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-319-14974-5_2
Vancouver
Ravelo SV, Ferreira CE. A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem [Internet]. Algorithms and Discrete Applied Mathematics: First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings. 2015 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-319-14974-5_2
Trabalho de evento
Aircraft air inlet design optimization via surrogate-assisted evolutionary computation (2015)
Lombardi, André; Ferrari, Denise Beatriz; Santos, Luis Carlos de Castro
Source: Evolutionary Multi-Criterion Optimization: 8th International Conference, EMO 2015, Guimarães, Portugal, March 29-April 1, 2015. Proceedings, Part II. Conference titles: International Conference on Evolutionary Multi-Criterion Optimization - EMO. Unidade: IME
Subjects: MECÂNICA DOS FLUÍDOS COMPUTACIONAL, ALGORITMOS, MATEMÁTICA APLICADA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LOMBARDI, André e FERRARI, Denise Beatriz e SANTOS, Luis Carlos de Castro. Aircraft air inlet design optimization via surrogate-assisted evolutionary computation. 2015, Anais.. Cham: Springer, 2015. Disponível em: https://doi.org/10.1007/978-3-319-15892-1_21. Acesso em: 17 nov. 2024.
APA
Lombardi, A., Ferrari, D. B., & Santos, L. C. de C. (2015). Aircraft air inlet design optimization via surrogate-assisted evolutionary computation. In Evolutionary Multi-Criterion Optimization: 8th International Conference, EMO 2015, Guimarães, Portugal, March 29-April 1, 2015. Proceedings, Part II. Cham: Springer. doi:10.1007/978-3-319-15892-1_21
NLM
Lombardi A, Ferrari DB, Santos LC de C. Aircraft air inlet design optimization via surrogate-assisted evolutionary computation [Internet]. Evolutionary Multi-Criterion Optimization: 8th International Conference, EMO 2015, Guimarães, Portugal, March 29-April 1, 2015. Proceedings, Part II. 2015 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-319-15892-1_21
Vancouver
Lombardi A, Ferrari DB, Santos LC de C. Aircraft air inlet design optimization via surrogate-assisted evolutionary computation [Internet]. Evolutionary Multi-Criterion Optimization: 8th International Conference, EMO 2015, Guimarães, Portugal, March 29-April 1, 2015. Proceedings, Part II. 2015 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-319-15892-1_21
Trabalho de evento
PTAS’s for some metric p-source communication spanning tree problems (2015)
Ravelo, Santiago Valdés; Ferreira, Carlos Eduardo
Source: Proceedings. Conference titles: International Workshop on Algorithms and Computation - WALCOM. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS, MATEMÁTICA DISCRETA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RAVELO, Santiago Valdés e FERREIRA, Carlos Eduardo. PTAS’s for some metric p-source communication spanning tree problems. 2015, Anais.. Cham: Springer, 2015. Disponível em: https://doi.org/10.1007/978-3-319-15612-5_13. Acesso em: 17 nov. 2024.
APA
Ravelo, S. V., & Ferreira, C. E. (2015). PTAS’s for some metric p-source communication spanning tree problems. In Proceedings. Cham: Springer. doi:10.1007/978-3-319-15612-5_13
NLM
Ravelo SV, Ferreira CE. PTAS’s for some metric p-source communication spanning tree problems [Internet]. Proceedings. 2015 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-319-15612-5_13
Vancouver
Ravelo SV, Ferreira CE. PTAS’s for some metric p-source communication spanning tree problems [Internet]. Proceedings. 2015 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-319-15612-5_13
Trabalho de evento
The envy-free pricing problem and unit-demand markets (2014)
Fernandes, Cristina Gomes ; Ferreira, Carlos Eduardo ; Franco, Álvaro Junio Pereira; Schouery, Rafael Crivellari Saliba
Source: Combinatorial optimization: Third International Symposium, ISCO 2014 Lisbon, Portugal, March 5–7, 2014, revised selected papers. Conference titles: International Symposium on Combinatorial Optimization - ISCO. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, MATEMÁTICA DA COMPUTAÇÃO, ALGORITMOS, REDES DE COMPUTADORES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes et al. The envy-free pricing problem and unit-demand markets. 2014, Anais.. Cham: Springer, 2014. Disponível em: https://doi.org/10.1007/978-3-319-09174-7_20. Acesso em: 17 nov. 2024.
APA
Fernandes, C. G., Ferreira, C. E., Franco, Á. J. P., & Schouery, R. C. S. (2014). The envy-free pricing problem and unit-demand markets. In Combinatorial optimization: Third International Symposium, ISCO 2014 Lisbon, Portugal, March 5–7, 2014, revised selected papers. Cham: Springer. doi:10.1007/978-3-319-09174-7_20
NLM
Fernandes CG, Ferreira CE, Franco ÁJP, Schouery RCS. The envy-free pricing problem and unit-demand markets [Internet]. Combinatorial optimization: Third International Symposium, ISCO 2014 Lisbon, Portugal, March 5–7, 2014, revised selected papers. 2014 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-319-09174-7_20
Vancouver
Fernandes CG, Ferreira CE, Franco ÁJP, Schouery RCS. The envy-free pricing problem and unit-demand markets [Internet]. Combinatorial optimization: Third International Symposium, ISCO 2014 Lisbon, Portugal, March 5–7, 2014, revised selected papers. 2014 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-319-09174-7_20
Parte de monografia/livro
Analyzing evolutionary algorithms for dynamic optimization problems based on the dynamical systems approach (2013)
Tinós, Renato; Yang, Shengxiang
Source: Evolutionary computation for dynamic optimization problems. Unidade: FFCLRP
Subjects: ALGORITMOS, SISTEMAS DINÂMICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TINÓS, Renato e YANG, Shengxiang. Analyzing evolutionary algorithms for dynamic optimization problems based on the dynamical systems approach. Evolutionary computation for dynamic optimization problems. Tradução . Heidelberg: Springer, 2013. . . Acesso em: 17 nov. 2024.
APA
Tinós, R., & Yang, S. (2013). Analyzing evolutionary algorithms for dynamic optimization problems based on the dynamical systems approach. In Evolutionary computation for dynamic optimization problems. Heidelberg: Springer.
NLM
Tinós R, Yang S. Analyzing evolutionary algorithms for dynamic optimization problems based on the dynamical systems approach. In: Evolutionary computation for dynamic optimization problems. Heidelberg: Springer; 2013. [citado 2024 nov. 17 ]
Vancouver
Tinós R, Yang S. Analyzing evolutionary algorithms for dynamic optimization problems based on the dynamical systems approach. In: Evolutionary computation for dynamic optimization problems. Heidelberg: Springer; 2013. [citado 2024 nov. 17 ]
Parte de monografia/livro-apres/pref/posf
Preface (2010)
Pimenta, Paulo de Mattos ; Wriggers, Peter
Source: New trends in thin structures: Formulation, optimization and coupled problems. Unidade: EP
Subjects: ANÁLISE NÃO LINEAR DE ESTRUTURAS, MODELOS MATEMÁTICOS, MÉTODO DOS ELEMENTOS FINITOS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PIMENTA, Paulo de Mattos e WRIGGERS, Peter. Preface. New trends in thin structures: Formulation, optimization and coupled problems. Wien: Springer. Disponível em: https://repositorio.usp.br/directbitstream/35a9e0de-bf97-4f83-9e84-d4e3d26eb599/Pimenta-2010-Preface.pdf. Acesso em: 17 nov. 2024. , 2010
APA
Pimenta, P. de M., & Wriggers, P. (2010). Preface. New trends in thin structures: Formulation, optimization and coupled problems. Wien: Springer. Recuperado de https://repositorio.usp.br/directbitstream/35a9e0de-bf97-4f83-9e84-d4e3d26eb599/Pimenta-2010-Preface.pdf
NLM
Pimenta P de M, Wriggers P. Preface [Internet]. New trends in thin structures: Formulation, optimization and coupled problems. 2010 ;[citado 2024 nov. 17 ] Available from: https://repositorio.usp.br/directbitstream/35a9e0de-bf97-4f83-9e84-d4e3d26eb599/Pimenta-2010-Preface.pdf
Vancouver
Pimenta P de M, Wriggers P. Preface [Internet]. New trends in thin structures: Formulation, optimization and coupled problems. 2010 ;[citado 2024 nov. 17 ] Available from: https://repositorio.usp.br/directbitstream/35a9e0de-bf97-4f83-9e84-d4e3d26eb599/Pimenta-2010-Preface.pdf
Trabalho de evento
A 5/3-approximation for finding spanning trees with many leaves in cubic graphs (2008)
Correa, Jose R; Fernandes, Cristina Gomes ; Matamala, Martin; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: International Workshop on Approximation and Online Algorithms. Unidade: IME
Subjects: ALGORITMOS, APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CORREA, Jose R et al. A 5/3-approximation for finding spanning trees with many leaves in cubic graphs. 2008, Anais.. Berlin: Springer, 2008. Disponível em: https://doi.org/10.1007/978-3-540-77918-6_15. Acesso em: 17 nov. 2024.
APA
Correa, J. R., Fernandes, C. G., Matamala, M., & Wakabayashi, Y. (2008). A 5/3-approximation for finding spanning trees with many leaves in cubic graphs. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-77918-6_15
NLM
Correa JR, Fernandes CG, Matamala M, Wakabayashi Y. A 5/3-approximation for finding spanning trees with many leaves in cubic graphs [Internet]. Proceedings. 2008 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-540-77918-6_15
Vancouver
Correa JR, Fernandes CG, Matamala M, Wakabayashi Y. A 5/3-approximation for finding spanning trees with many leaves in cubic graphs [Internet]. Proceedings. 2008 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-540-77918-6_15
Trabalho de evento
Strong probabilistic planning (2008)
Pereira, Silvio do Lago; Barros, Leliane Nunes de ; Cozman, Fabio Gagliardi
Source: Proceedings. Conference titles: Mexican International Conference on Artificial Intelligence - MICAI. Unidades: IME, EP
Subjects: PROCESSOS DE MARKOV, ALGORITMOS, INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PEREIRA, Silvio do Lago e BARROS, Leliane Nunes de e COZMAN, Fabio Gagliardi. Strong probabilistic planning. 2008, Anais.. Berlin: Springer, 2008. Disponível em: https://doi.org/10.1007/978-3-540-88636-5_61. Acesso em: 17 nov. 2024.
APA
Pereira, S. do L., Barros, L. N. de, & Cozman, F. G. (2008). Strong probabilistic planning. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-88636-5_61
NLM
Pereira S do L, Barros LN de, Cozman FG. Strong probabilistic planning [Internet]. Proceedings. 2008 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-540-88636-5_61
Vancouver
Pereira S do L, Barros LN de, Cozman FG. Strong probabilistic planning [Internet]. Proceedings. 2008 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-540-88636-5_61
Trabalho de evento
A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers (2006)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto ; Song, Siang Wun
Source: Proceedings. Conference titles: European Conference on Parallel Processing - Euro-Par. Unidade: IME
Subjects: TEORIA DA INFORMAÇÃO, TEORIA DOS NÚMEROS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Carlos Eduardo Rodrigues e CÁCERES, Edson Norberto e SONG, Siang Wun. A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers. 2006, Anais.. Berlin: Springer, 2006. Disponível em: https://doi.org/10.1007/11823285_87. Acesso em: 17 nov. 2024.
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2006). A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers. In Proceedings. Berlin: Springer. doi:10.1007/11823285_87
NLM
Alves CER, Cáceres EN, Song SW. A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers [Internet]. Proceedings. 2006 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/11823285_87
Vancouver
Alves CER, Cáceres EN, Song SW. A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers [Internet]. Proceedings. 2006 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/11823285_87
Trabalho de evento
Diagnostic of programs for programming learning tools (2006)
Delgado, Karina Valdivia ; Barros, Leliane Nunes de
Source: Proceedings. Conference titles: Ibero-American Conference on Artificial Intelligence - IBERAMIA. Unidade: IME
Subjects: ALGORITMOS, INTELIGÊNCIA ARTIFICIAL, ENGENHARIA DE SOFTWARE, SOLUÇÃO DE PROBLEMAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELGADO, Karina Valdivia e BARROS, Leliane Nunes de. Diagnostic of programs for programming learning tools. 2006, Anais.. Berlin: Springer, 2006. Disponível em: https://doi.org/10.1007/11874850_5. Acesso em: 17 nov. 2024.
APA
Delgado, K. V., & Barros, L. N. de. (2006). Diagnostic of programs for programming learning tools. In Proceedings. Berlin: Springer. doi:10.1007/11874850_5
NLM
Delgado KV, Barros LN de. Diagnostic of programs for programming learning tools [Internet]. Proceedings. 2006 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/11874850_5
Vancouver
Delgado KV, Barros LN de. Diagnostic of programs for programming learning tools [Internet]. Proceedings. 2006 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/11874850_5
Trabalho de evento
Approximating rational objectives is as easy as approximating linear ones (2006)
Correa Júnior, José R.; Fernandes, Cristina Gomes ; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: Scandinavian Workshop on algorithm theory - SWAT. Unidade: IME
Subjects: ALGORITMOS, PROGRAMAÇÃO LINEAR, MATEMÁTICA DISCRETA, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CORREA JÚNIOR, José R. e FERNANDES, Cristina Gomes e WAKABAYASHI, Yoshiko. Approximating rational objectives is as easy as approximating linear ones. 2006, Anais.. Berlin: Springer, 2006. Disponível em: https://doi.org/10.1007/11785293_33. Acesso em: 17 nov. 2024.
APA
Correa Júnior, J. R., Fernandes, C. G., & Wakabayashi, Y. (2006). Approximating rational objectives is as easy as approximating linear ones. In Proceedings. Berlin: Springer. doi:10.1007/11785293_33
NLM
Correa Júnior JR, Fernandes CG, Wakabayashi Y. Approximating rational objectives is as easy as approximating linear ones [Internet]. Proceedings. 2006 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/11785293_33
Vancouver
Correa Júnior JR, Fernandes CG, Wakabayashi Y. Approximating rational objectives is as easy as approximating linear ones [Internet]. Proceedings. 2006 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/11785293_33

USP Schools

ReP

Filtros

USP Schools

Departament

Authors

USP affiliated authors

Date published

Subjects

Source title

Conference titles

Countries/Territories

Funding Agencies

Non normalized affiliation

Countries of institutions of collaboration