ReP USP - Resultado da busca

Trabalho de evento
Transgenic genetic algorithm to minimize the makespan in the job shop scheduling problem (2020)
Viana, Monique Simplicio ; Morandin Junior, Orides ; Contreras, Rodrigo Colnago
Source: Proceedings. Conference titles: International Conference on Agents and Artificial Intelligence - ICAART. Unidade: ICMC
Subjects: ALGORITMOS GENÉTICOS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VIANA, Monique Simplicio e MORANDIN JUNIOR, Orides e CONTRERAS, Rodrigo Colnago. Transgenic genetic algorithm to minimize the makespan in the job shop scheduling problem. 2020, Anais.. Lisboa: SciTePress, 2020. Disponível em: https://doi.org/10.5220/0008937004630474. Acesso em: 31 jan. 2025.
APA
Viana, M. S., Morandin Junior, O., & Contreras, R. C. (2020). Transgenic genetic algorithm to minimize the makespan in the job shop scheduling problem. In Proceedings. Lisboa: SciTePress. doi:10.5220/0008937004630474
NLM
Viana MS, Morandin Junior O, Contreras RC. Transgenic genetic algorithm to minimize the makespan in the job shop scheduling problem [Internet]. Proceedings. 2020 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.5220/0008937004630474
Vancouver
Viana MS, Morandin Junior O, Contreras RC. Transgenic genetic algorithm to minimize the makespan in the job shop scheduling problem [Internet]. Proceedings. 2020 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.5220/0008937004630474
Trabalho de evento
An RBF network based crossover for pseudo-boolean optimization (2019)
Tinós, Renato
Source: Proceedings. Conference titles: Brazilian Conference on Intelligent Systems (BRACIS). Unidade: FFCLRP
Subjects: ALGORITMOS GENÉTICOS, REDES NEURAIS, RECOMBINAÇÃO GENÉTICA, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TINÓS, Renato. An RBF network based crossover for pseudo-boolean optimization. 2019, Anais.. Piscataway: IEEE, 2019. Disponível em: https://doi.org/10.1109/BRACIS.2019.00039. Acesso em: 31 jan. 2025.
APA
Tinós, R. (2019). An RBF network based crossover for pseudo-boolean optimization. In Proceedings. Piscataway: IEEE. doi:10.1109/BRACIS.2019.00039
NLM
Tinós R. An RBF network based crossover for pseudo-boolean optimization [Internet]. Proceedings. 2019 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1109/BRACIS.2019.00039
Vancouver
Tinós R. An RBF network based crossover for pseudo-boolean optimization [Internet]. Proceedings. 2019 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1109/BRACIS.2019.00039
Trabalho de evento
A new method for identification of recombining components in the generalized partition crossover (2019)
Carvalho, Ozeas Quevedo de; Tinós, Renato ; Whitley, Darrell; Sanches, Danilo Sipoli
Source: Proceedings. Conference titles: Brazilian Conference on Intelligent Systems (BRACIS). Unidade: FFCLRP
Assunto: OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CARVALHO, Ozeas Quevedo de et al. A new method for identification of recombining components in the generalized partition crossover. 2019, Anais.. Piscataway: IEEE, 2019. Disponível em: https://doi.org/10.1109/BRACIS.2019.00016. Acesso em: 31 jan. 2025.
APA
Carvalho, O. Q. de, Tinós, R., Whitley, D., & Sanches, D. S. (2019). A new method for identification of recombining components in the generalized partition crossover. In Proceedings. Piscataway: IEEE. doi:10.1109/BRACIS.2019.00016
NLM
Carvalho OQ de, Tinós R, Whitley D, Sanches DS. A new method for identification of recombining components in the generalized partition crossover [Internet]. Proceedings. 2019 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1109/BRACIS.2019.00016
Vancouver
Carvalho OQ de, Tinós R, Whitley D, Sanches DS. A new method for identification of recombining components in the generalized partition crossover [Internet]. Proceedings. 2019 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1109/BRACIS.2019.00016
Trabalho de evento
Using hyperplanes to create neutral networks in pseudo-boolean optimization (2019)
Tinós, Renato
Source: Proceedings. Conference titles: Brazilian Conference on Intelligent Systems (BRACIS). Unidade: FFCLRP
Subjects: ALGORITMOS GENÉTICOS, REDES NEURAIS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TINÓS, Renato. Using hyperplanes to create neutral networks in pseudo-boolean optimization. 2019, Anais.. Piscataway: IEEE, 2019. Disponível em: https://doi.org/10.1109/BRACIS.2019.00069. Acesso em: 31 jan. 2025.
APA
Tinós, R. (2019). Using hyperplanes to create neutral networks in pseudo-boolean optimization. In Proceedings. Piscataway: IEEE. doi:10.1109/BRACIS.2019.00069
NLM
Tinós R. Using hyperplanes to create neutral networks in pseudo-boolean optimization [Internet]. Proceedings. 2019 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1109/BRACIS.2019.00069
Vancouver
Tinós R. Using hyperplanes to create neutral networks in pseudo-boolean optimization [Internet]. Proceedings. 2019 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1109/BRACIS.2019.00069
Trabalho de evento
Covering a graph with nontrivial vertex-disjoint paths: existence and optimization (2018)
Gómez, Renzo; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: International Workshop on Graph-Theoretic Concepts in Computer Science - WG. Unidade: IME
Subjects: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GÓMEZ, Renzo e WAKABAYASHI, Yoshiko. Covering a graph with nontrivial vertex-disjoint paths: existence and optimization. 2018, Anais.. Cham: Springer, 2018. Disponível em: https://doi.org/10.1007/978-3-030-00256-5_19. Acesso em: 31 jan. 2025.
APA
Gómez, R., & Wakabayashi, Y. (2018). Covering a graph with nontrivial vertex-disjoint paths: existence and optimization. In Proceedings. Cham: Springer. doi:10.1007/978-3-030-00256-5_19
NLM
Gómez R, Wakabayashi Y. Covering a graph with nontrivial vertex-disjoint paths: existence and optimization [Internet]. Proceedings. 2018 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1007/978-3-030-00256-5_19
Vancouver
Gómez R, Wakabayashi Y. Covering a graph with nontrivial vertex-disjoint paths: existence and optimization [Internet]. Proceedings. 2018 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1007/978-3-030-00256-5_19
Trabalho de evento
The online multicommodity connected facility location problem (2018)
San Felice, Mário César; Fernandes, Cristina Gomes ; Lintzmayer, Carla Negri
Source: Proceedings. Conference titles: International Workshop on Approximation and Online Algorithms - WAOA. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, COMPUTABILIDADE E COMPLEXIDADE, TEORIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SAN FELICE, Mário César e FERNANDES, Cristina Gomes e LINTZMAYER, Carla Negri. The online multicommodity connected facility location problem. 2018, Anais.. Cham: Springer, 2018. Disponível em: https://doi.org/10.1007/978-3-319-89441-6_10. Acesso em: 31 jan. 2025.
APA
San Felice, M. C., Fernandes, C. G., & Lintzmayer, C. N. (2018). The online multicommodity connected facility location problem. In Proceedings. Cham: Springer. doi:10.1007/978-3-319-89441-6_10
NLM
San Felice MC, Fernandes CG, Lintzmayer CN. The online multicommodity connected facility location problem [Internet]. Proceedings. 2018 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1007/978-3-319-89441-6_10
Vancouver
San Felice MC, Fernandes CG, Lintzmayer CN. The online multicommodity connected facility location problem [Internet]. Proceedings. 2018 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1007/978-3-319-89441-6_10
Trabalho de evento
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game (2018)
Kohayakawa, Yoshiharu ; Miyazawa, Flávio Keidi; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN 2018. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS PARA PROCESSAMENTO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e MIYAZAWA, Flávio Keidi e WAKABAYASHI, Yoshiko. A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game. 2018, Anais.. Cham: Springer, 2018. Disponível em: https://doi.org/10.1007/978-3-319-77404-6_51. Acesso em: 31 jan. 2025.
APA
Kohayakawa, Y., Miyazawa, F. K., & Wakabayashi, Y. (2018). A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game. In Proceedings. Cham: Springer. doi:10.1007/978-3-319-77404-6_51
NLM
Kohayakawa Y, Miyazawa FK, Wakabayashi Y. A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game [Internet]. Proceedings. 2018 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1007/978-3-319-77404-6_51
Vancouver
Kohayakawa Y, Miyazawa FK, Wakabayashi Y. A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game [Internet]. Proceedings. 2018 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1007/978-3-319-77404-6_51
Trabalho de evento
A fusion mechanism for the generalized asymmetric partition crossover (2018)
Tinós, Renato ; Whitley, Darrell
Source: Proceedings. Conference titles: IEEE Congress on Evolutionary Computation (CEC). Unidade: FFCLRP
Subjects: OPERADORES, OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS GENÉTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TINÓS, Renato e WHITLEY, Darrell. A fusion mechanism for the generalized asymmetric partition crossover. 2018, Anais.. Psicataway: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto, Universidade de São Paulo, 2018. Disponível em: https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8477800. Acesso em: 31 jan. 2025.
APA
Tinós, R., & Whitley, D. (2018). A fusion mechanism for the generalized asymmetric partition crossover. In Proceedings. Psicataway: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto, Universidade de São Paulo. Recuperado de https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8477800
NLM
Tinós R, Whitley D. A fusion mechanism for the generalized asymmetric partition crossover [Internet]. Proceedings. 2018 ;[citado 2025 jan. 31 ] Available from: https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8477800
Vancouver
Tinós R, Whitley D. A fusion mechanism for the generalized asymmetric partition crossover [Internet]. Proceedings. 2018 ;[citado 2025 jan. 31 ] Available from: https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8477800
Trabalho de evento
Building a better heuristic for the traveling salesman problem (2017)
Sanches, Danilo; Whitley, Darrell; Tinós, Renato
Source: Proceedings. Conference titles: Genetic and Evolutionary Computation Conference (GECCO). Unidade: FFCLRP
Subjects: OTIMIZAÇÃO COMBINATÓRIA, ESTUDOS RANDOMIZADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SANCHES, Danilo e WHITLEY, Darrell e TINÓS, Renato. Building a better heuristic for the traveling salesman problem. 2017, Anais.. Berlin: ACM, 2017. Disponível em: https://doi.org/10.1145/3071178.3071305. Acesso em: 31 jan. 2025.
APA
Sanches, D., Whitley, D., & Tinós, R. (2017). Building a better heuristic for the traveling salesman problem. In Proceedings. Berlin: ACM. doi:10.1145/3071178.3071305
NLM
Sanches D, Whitley D, Tinós R. Building a better heuristic for the traveling salesman problem [Internet]. Proceedings. 2017 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1145/3071178.3071305
Vancouver
Sanches D, Whitley D, Tinós R. Building a better heuristic for the traveling salesman problem [Internet]. Proceedings. 2017 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1145/3071178.3071305
Trabalho de evento
A new evaluation function for clustering: the NK internal validation criterion (2016)
Tinós, Renato; Chicano, Francisco; Liang, Zhao; Whitley, Darrell
Source: Proceedings. Conference titles: Genetic and Evolutionary Computation Conference. Unidade: FFCLRP
Subjects: COMPUTAÇÃO EVOLUTIVA, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TINÓS, Renato et al. A new evaluation function for clustering: the NK internal validation criterion. 2016, Anais.. Denver: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto, Universidade de São Paulo, 2016. Disponível em: https://doi.org/10.1145/2908812.2908831. Acesso em: 31 jan. 2025.
APA
Tinós, R., Chicano, F., Liang, Z., & Whitley, D. (2016). A new evaluation function for clustering: the NK internal validation criterion. In Proceedings. Denver: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto, Universidade de São Paulo. doi:10.1145/2908812.2908831
NLM
Tinós R, Chicano F, Liang Z, Whitley D. A new evaluation function for clustering: the NK internal validation criterion [Internet]. Proceedings. 2016 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1145/2908812.2908831
Vancouver
Tinós R, Chicano F, Liang Z, Whitley D. A new evaluation function for clustering: the NK internal validation criterion [Internet]. Proceedings. 2016 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1145/2908812.2908831
Trabalho de evento
Improved approximation algorithms for capacitated fault-tolerant k-center (2016)
Fernandes, Cristina Gomes ; Paula, Samuel P. de
Source: Proceedings. Conference titles: Latin American Theoretical Informatics Symposium - LATIN. Unidade: IME
Subjects: CIÊNCIA DA COMPUTAÇÃO, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e PAULA, Samuel P. de. Improved approximation algorithms for capacitated fault-tolerant k-center. 2016, Anais.. Berlin: Springer, 2016. Disponível em: https://doi.org/10.1007/978-3-662-49529-2_33. Acesso em: 31 jan. 2025.
APA
Fernandes, C. G., & Paula, S. P. de. (2016). Improved approximation algorithms for capacitated fault-tolerant k-center. In Proceedings. Berlin: Springer. doi:10.1007/978-3-662-49529-2_33
NLM
Fernandes CG, Paula SP de. Improved approximation algorithms for capacitated fault-tolerant k-center [Internet]. Proceedings. 2016 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1007/978-3-662-49529-2_33
Vancouver
Fernandes CG, Paula SP de. Improved approximation algorithms for capacitated fault-tolerant k-center [Internet]. Proceedings. 2016 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1007/978-3-662-49529-2_33
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: 31 jan. 2025.
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 2025 jan. 31 ] 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 2025 jan. 31 ] Available from: https://doi.org/10.1007/978-3-319-15612-5_13
Trabalho de evento
Accelerating the over-relaxed iterative shrinkage-thresholding algorithms with fast and exact line search for high resolution tomographic image reconstruction (2015)
Zibetti, Marcelo V. W; Helou, Elias Salomão ; Miqueles, Eduardo X; Pierro, Alvaro R. De
Source: Proceedings. Conference titles: IEEE International Conference on Image Processing - ICIP. Unidade: ICMC
Subjects: OTIMIZAÇÃO, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ZIBETTI, Marcelo V. W et al. Accelerating the over-relaxed iterative shrinkage-thresholding algorithms with fast and exact line search for high resolution tomographic image reconstruction. 2015, Anais.. Los Alamitos, CA: IEEE, 2015. Disponível em: https://doi.org/10.1109/ICIP.2015.7351213. Acesso em: 31 jan. 2025.
APA
Zibetti, M. V. W., Helou, E. S., Miqueles, E. X., & Pierro, A. R. D. (2015). Accelerating the over-relaxed iterative shrinkage-thresholding algorithms with fast and exact line search for high resolution tomographic image reconstruction. In Proceedings. Los Alamitos, CA: IEEE. doi:10.1109/ICIP.2015.7351213
NLM
Zibetti MVW, Helou ES, Miqueles EX, Pierro ARD. Accelerating the over-relaxed iterative shrinkage-thresholding algorithms with fast and exact line search for high resolution tomographic image reconstruction [Internet]. Proceedings. 2015 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1109/ICIP.2015.7351213
Vancouver
Zibetti MVW, Helou ES, Miqueles EX, Pierro ARD. Accelerating the over-relaxed iterative shrinkage-thresholding algorithms with fast and exact line search for high resolution tomographic image reconstruction [Internet]. Proceedings. 2015 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1109/ICIP.2015.7351213
Trabalho de evento
Malleable resource sharing algorithms for cooperative resolution of problems (2012)
Goldman, Alfredo ; Ngoko, Yanik; Trystram, Denis
Source: Proceedings. Conference titles: IEEE Congress on Evolutionary Computation - CEC. Unidade: IME
Subjects: ALGORITMOS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GOLDMAN, Alfredo e NGOKO, Yanik e TRYSTRAM, Denis. Malleable resource sharing algorithms for cooperative resolution of problems. 2012, Anais.. Piscataway: IEEE, 2012. Disponível em: https://doi.org/10.1109/CEC.2012.6256524. Acesso em: 31 jan. 2025.
APA
Goldman, A., Ngoko, Y., & Trystram, D. (2012). Malleable resource sharing algorithms for cooperative resolution of problems. In Proceedings. Piscataway: IEEE. doi:10.1109/CEC.2012.6256524
NLM
Goldman A, Ngoko Y, Trystram D. Malleable resource sharing algorithms for cooperative resolution of problems [Internet]. Proceedings. 2012 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1109/CEC.2012.6256524
Vancouver
Goldman A, Ngoko Y, Trystram D. Malleable resource sharing algorithms for cooperative resolution of problems [Internet]. Proceedings. 2012 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1109/CEC.2012.6256524
Trabalho de evento
Minimum ratio cover of matrix columns by extreme rays of its induced cone (2012)
Freire, Alexandre da Silva; Acuña, Vicente; Crescenzi, Pierluigi; Ferreira, Carlos Eduardo ; Lacroix, Vincent; Milreu, P. V; Moreno, E; Sagot, Marie-France
Source: Proceedings. Conference titles: International Symposium on Combinatorial Optimization - ISCO. Unidade: IME
Assunto: OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FREIRE, Alexandre da Silva et al. Minimum ratio cover of matrix columns by extreme rays of its induced cone. 2012, Anais.. Berlin: Springer, 2012. Disponível em: https://doi.org/10.1007/978-3-642-32147-4_16. Acesso em: 31 jan. 2025.
APA
Freire, A. da S., Acuña, V., Crescenzi, P., Ferreira, C. E., Lacroix, V., Milreu, P. V., et al. (2012). Minimum ratio cover of matrix columns by extreme rays of its induced cone. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-32147-4_16
NLM
Freire A da S, Acuña V, Crescenzi P, Ferreira CE, Lacroix V, Milreu PV, Moreno E, Sagot M-F. Minimum ratio cover of matrix columns by extreme rays of its induced cone [Internet]. Proceedings. 2012 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1007/978-3-642-32147-4_16
Vancouver
Freire A da S, Acuña V, Crescenzi P, Ferreira CE, Lacroix V, Milreu PV, Moreno E, Sagot M-F. Minimum ratio cover of matrix columns by extreme rays of its induced cone [Internet]. Proceedings. 2012 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1007/978-3-642-32147-4_16
Trabalho de evento
A hybrid path-relinking method for solving a stochastic lot sizing and scheduling problem (2012)
Amorim, P; Almada-Lobo, B; Costa, Alysson Machado; Costa, Alysson Machado
Source: Proceedings. Conference titles: International Workshop on Model Based Metaheuristics - Matheuristics’2012. Unidade: ICMC
Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
AMORIM, P et al. A hybrid path-relinking method for solving a stochastic lot sizing and scheduling problem. 2012, Anais.. São Domingos Niterói, RJ: IC/UFF, 2012. . Acesso em: 31 jan. 2025.
APA
Amorim, P., Almada-Lobo, B., Costa, A. M., & Costa, A. M. (2012). A hybrid path-relinking method for solving a stochastic lot sizing and scheduling problem. In Proceedings. São Domingos Niterói, RJ: IC/UFF.
NLM
Amorim P, Almada-Lobo B, Costa AM, Costa AM. A hybrid path-relinking method for solving a stochastic lot sizing and scheduling problem. Proceedings. 2012 ;[citado 2025 jan. 31 ]
Vancouver
Amorim P, Almada-Lobo B, Costa AM, Costa AM. A hybrid path-relinking method for solving a stochastic lot sizing and scheduling problem. Proceedings. 2012 ;[citado 2025 jan. 31 ]
Trabalho de evento
A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems (2012)
Fernandes, Cristina Gomes ; Meira, Luis A. A; Miyazawa, Flavio Keidi ; Pedrosa, Lehilton L. C
Source: Proceedings. Conference titles: International Workshop on Approximation Algorithms for Combinatorial Optimization - APPROX. Unidade: IME
Assunto: OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes et al. A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems. 2012, Anais.. Berlin: Springer, 2012. Disponível em: https://doi.org/10.1007/978-3-642-32512-0_13. Acesso em: 31 jan. 2025.
APA
Fernandes, C. G., Meira, L. A. A., Miyazawa, F. K., & Pedrosa, L. L. C. (2012). A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-32512-0_13
NLM
Fernandes CG, Meira LAA, Miyazawa FK, Pedrosa LLC. A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems [Internet]. Proceedings. 2012 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1007/978-3-642-32512-0_13
Vancouver
Fernandes CG, Meira LAA, Miyazawa FK, Pedrosa LLC. A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems [Internet]. Proceedings. 2012 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1007/978-3-642-32512-0_13
Trabalho de evento
A column generation approach for the graph matching problem (2010)
Freire, Alexandre da Silva; César Júnior, Roberto Marcondes ; Ferreira, Carlos Eduardo
Source: Proceedings. Conference titles: International Conference on Pattern Recognition - ICPR. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, RECONHECIMENTO DE PADRÕES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FREIRE, Alexandre da Silva e CÉSAR JÚNIOR, Roberto Marcondes e FERREIRA, Carlos Eduardo. A column generation approach for the graph matching problem. 2010, Anais.. Piscataway: IEEE, 2010. Disponível em: https://doi.org/10.1109/ICPR.2010.272. Acesso em: 31 jan. 2025.
APA
Freire, A. da S., César Júnior, R. M., & Ferreira, C. E. (2010). A column generation approach for the graph matching problem. In Proceedings. Piscataway: IEEE. doi:10.1109/ICPR.2010.272
NLM
Freire A da S, César Júnior RM, Ferreira CE. A column generation approach for the graph matching problem [Internet]. Proceedings. 2010 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1109/ICPR.2010.272
Vancouver
Freire A da S, César Júnior RM, Ferreira CE. A column generation approach for the graph matching problem [Internet]. Proceedings. 2010 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1109/ICPR.2010.272
Trabalho de evento
An oscillatory correlation model of object-based attention (2009)
Quiles, Marcos Gonçalves; DeLiang Wang; Liang Zhao; Romero, Roseli Aparecida Francelin ; De-Shuang
Source: Proceedings. Conference titles: International Joint Conference on Neural Networks - IJCNN. Unidade: ICMC
Subjects: INTELIGÊNCIA ARTIFICIAL, OTIMIZAÇÃO COMBINATÓRIA, COMPUTAÇÃO GRÁFICA, PROCESSAMENTO DE IMAGENS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
QUILES, Marcos Gonçalves et al. An oscillatory correlation model of object-based attention. 2009, Anais.. Piscataway: IEEE, 2009. Disponível em: https://doi.org/10.1109/IJCNN.2009.5178597. Acesso em: 31 jan. 2025.
APA
Quiles, M. G., DeLiang Wang,, Liang Zhao,, Romero, R. A. F., & De-Shuang,. (2009). An oscillatory correlation model of object-based attention. In Proceedings. Piscataway: IEEE. doi:10.1109/IJCNN.2009.5178597
NLM
Quiles MG, DeLiang Wang, Liang Zhao, Romero RAF, De-Shuang. An oscillatory correlation model of object-based attention [Internet]. Proceedings. 2009 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1109/IJCNN.2009.5178597
Vancouver
Quiles MG, DeLiang Wang, Liang Zhao, Romero RAF, De-Shuang. An oscillatory correlation model of object-based attention [Internet]. Proceedings. 2009 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1109/IJCNN.2009.5178597
Trabalho de evento
Relational reinforcement learning applied to shared attention (2009)
Silva, Renato R. da; Policastro, Claudio A.; Romero, Roseli Aparecida Francelin
Source: Proceedings. Conference titles: International Joint Conference on Neural Networks - IJCNN. Unidade: ICMC
Subjects: INTELIGÊNCIA ARTIFICIAL, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Renato R. da e POLICASTRO, Claudio A. e ROMERO, Roseli Aparecida Francelin. Relational reinforcement learning applied to shared attention. 2009, Anais.. Piscataway: IEEE, 2009. Disponível em: https://doi.org/10.1109/IJCNN.2009.5178735. Acesso em: 31 jan. 2025.
APA
Silva, R. R. da, Policastro, C. A., & Romero, R. A. F. (2009). Relational reinforcement learning applied to shared attention. In Proceedings. Piscataway: IEEE. doi:10.1109/IJCNN.2009.5178735
NLM
Silva RR da, Policastro CA, Romero RAF. Relational reinforcement learning applied to shared attention [Internet]. Proceedings. 2009 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1109/IJCNN.2009.5178735
Vancouver
Silva RR da, Policastro CA, Romero RAF. Relational reinforcement learning applied to shared attention [Internet]. Proceedings. 2009 ;[citado 2025 jan. 31 ] Available from: https://doi.org/10.1109/IJCNN.2009.5178735

USP Schools

ReP

Filtros

Departament

Authors

USP affiliated authors

Date published

Subjects

Publisher

Conference titles

Funding Agencies

Non normalized affiliation

Countries of institutions of collaboration