ReP USP - Resultado da busca

Trabalho de evento-anais periodico
Partition crossover for continuous optimization: ePX (2021)
Tinós, Renato ; Whitley, Darrell; Chicano, Francisco; Ochoa, Gabriela
Source: Proceedings GECCO '21. Conference titles: Genetic and Evolutionary Computation Conference - GECCO '21. Unidade: FFCLRP
Subjects: OTIMIZAÇÃO COMBINATÓRIA, TEORIA DA COMPUTAÇÃO, OPERADORES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TINÓS, Renato et al. Partition crossover for continuous optimization: ePX. Proceedings GECCO '21. New York: ACM. Disponível em: https://doi.org/10.1145/3449639.3459296. Acesso em: 16 nov. 2024. , 2021
APA
Tinós, R., Whitley, D., Chicano, F., & Ochoa, G. (2021). Partition crossover for continuous optimization: ePX. Proceedings GECCO '21. New York: ACM. doi:10.1145/3449639.3459296
NLM
Tinós R, Whitley D, Chicano F, Ochoa G. Partition crossover for continuous optimization: ePX [Internet]. Proceedings GECCO '21. 2021 ;[citado 2024 nov. 16 ] Available from: https://doi.org/10.1145/3449639.3459296
Vancouver
Tinós R, Whitley D, Chicano F, Ochoa G. Partition crossover for continuous optimization: ePX [Internet]. Proceedings GECCO '21. 2021 ;[citado 2024 nov. 16 ] Available from: https://doi.org/10.1145/3449639.3459296
Trabalho de evento-anais periodico
An efficient implementation of iterative partial transcription for the traveling salesman problem (2021)
Mukhopadhyay, Anirban; Whitley, Darrell; Tinós, Renato
Source: Proceedings GECCO '21. Conference titles: The Genetic and Evolutionary Computation Conference (GECCO '21). Unidade: FFCLRP
Subjects: TABELAS DE CONTINGÊNCIA, ALGORITMOS, TEORIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MUKHOPADHYAY, Anirban e WHITLEY, Darrell e TINÓS, Renato. An efficient implementation of iterative partial transcription for the traveling salesman problem. Proceedings GECCO '21. New York: ACM. Disponível em: https://doi.org/10.1145/3449639.3459368. Acesso em: 16 nov. 2024. , 2021
APA
Mukhopadhyay, A., Whitley, D., & Tinós, R. (2021). An efficient implementation of iterative partial transcription for the traveling salesman problem. Proceedings GECCO '21. New York: ACM. doi:10.1145/3449639.3459368
NLM
Mukhopadhyay A, Whitley D, Tinós R. An efficient implementation of iterative partial transcription for the traveling salesman problem [Internet]. Proceedings GECCO '21. 2021 ;[citado 2024 nov. 16 ] Available from: https://doi.org/10.1145/3449639.3459368
Vancouver
Mukhopadhyay A, Whitley D, Tinós R. An efficient implementation of iterative partial transcription for the traveling salesman problem [Internet]. Proceedings GECCO '21. 2021 ;[citado 2024 nov. 16 ] Available from: https://doi.org/10.1145/3449639.3459368
Trabalho de evento-anais periodico
Enhancing partition crossover with articulation points analysis (2018)
Chicano, Francisco ; Ochoa, Gabriela ; Whitley, Darrell; Tinós, Renato
Source: Proceedings GECCO '18. Conference titles: The Genetic and Evolutionary Computation Conference (GECCO '18). Unidade: FFCLRP
Subjects: OTIMIZAÇÃO COMBINATÓRIA, MATEMÁTICA DA COMPUTAÇÃO, CIÊNCIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CHICANO, Francisco et al. Enhancing partition crossover with articulation points analysis. Proceedings GECCO '18. New York: ACM. Disponível em: https://riuma.uma.es/xmlui/bitstream/handle/10630/16353/pxap-gecco2018-riuma.pdf?sequence=1&isAllowed=y. Acesso em: 16 nov. 2024. , 2018
APA
Chicano, F., Ochoa, G., Whitley, D., & Tinós, R. (2018). Enhancing partition crossover with articulation points analysis. Proceedings GECCO '18. New York: ACM. Recuperado de https://riuma.uma.es/xmlui/bitstream/handle/10630/16353/pxap-gecco2018-riuma.pdf?sequence=1&isAllowed=y
NLM
Chicano F, Ochoa G, Whitley D, Tinós R. Enhancing partition crossover with articulation points analysis [Internet]. Proceedings GECCO '18. 2018 ;[citado 2024 nov. 16 ] Available from: https://riuma.uma.es/xmlui/bitstream/handle/10630/16353/pxap-gecco2018-riuma.pdf?sequence=1&isAllowed=y
Vancouver
Chicano F, Ochoa G, Whitley D, Tinós R. Enhancing partition crossover with articulation points analysis [Internet]. Proceedings GECCO '18. 2018 ;[citado 2024 nov. 16 ] Available from: https://riuma.uma.es/xmlui/bitstream/handle/10630/16353/pxap-gecco2018-riuma.pdf?sequence=1&isAllowed=y
Trabalho de evento-anais periodico
Tunneling between plateaus: improving on a state-of-the-art MAXSAT solver using partition crossover (2018)
Chen, Wenxiang; Whitley, Darrell; Tinós, Renato ; Chicano, Francisco
Source: Proceedings GECCO '18. Conference titles: The Genetic and Evolutionary Computation Conference (GECCO '18). Unidade: FFCLRP
Subjects: ALGORITMOS GENÉTICOS, CIÊNCIA DA COMPUTAÇÃO, MATEMÁTICA, GENÉTICA, SATISFAÇÃO DE SOFTWARE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CHEN, Wenxiang et al. Tunneling between plateaus: improving on a state-of-the-art MAXSAT solver using partition crossover. Proceedings GECCO '18. New York: ACM. Disponível em: https://doi.org/10.1145/3205455.3205482. Acesso em: 16 nov. 2024. , 2018
APA
Chen, W., Whitley, D., Tinós, R., & Chicano, F. (2018). Tunneling between plateaus: improving on a state-of-the-art MAXSAT solver using partition crossover. Proceedings GECCO '18. New York: ACM. doi:10.1145/3205455.3205482
NLM
Chen W, Whitley D, Tinós R, Chicano F. Tunneling between plateaus: improving on a state-of-the-art MAXSAT solver using partition crossover [Internet]. Proceedings GECCO '18. 2018 ;[citado 2024 nov. 16 ] Available from: https://doi.org/10.1145/3205455.3205482
Vancouver
Chen W, Whitley D, Tinós R, Chicano F. Tunneling between plateaus: improving on a state-of-the-art MAXSAT solver using partition crossover [Internet]. Proceedings GECCO '18. 2018 ;[citado 2024 nov. 16 ] Available from: https://doi.org/10.1145/3205455.3205482
Trabalho de evento
Improving an exact solver for the Traveling Salesman Problem using partition crossover (2017)
Sanches, Danilo; Whitley, Darrell; Tinós, Renato
Source: Proceedings. Conference titles: Genetic and Evolutionary Computation Conference (GECCO). Unidade: FFCLRP
Subjects: INTELIGÊNCIA ARTIFICIAL, APRENDIZADO COMPUTACIONAL
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. Improving an exact solver for the Traveling Salesman Problem using partition crossover. 2017, Anais.. Berlin: ACM, 2017. Disponível em: https://doi.org/10.1145/3071178.3071304. Acesso em: 16 nov. 2024.
APA
Sanches, D., Whitley, D., & Tinós, R. (2017). Improving an exact solver for the Traveling Salesman Problem using partition crossover. In Proceedings. Berlin: ACM. doi:10.1145/3071178.3071304
NLM
Sanches D, Whitley D, Tinós R. Improving an exact solver for the Traveling Salesman Problem using partition crossover [Internet]. Proceedings. 2017 ;[citado 2024 nov. 16 ] Available from: https://doi.org/10.1145/3071178.3071304
Vancouver
Sanches D, Whitley D, Tinós R. Improving an exact solver for the Traveling Salesman Problem using partition crossover [Internet]. Proceedings. 2017 ;[citado 2024 nov. 16 ] Available from: https://doi.org/10.1145/3071178.3071304
Trabalho de evento
Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search (2017)
Chicano, Francisco; Ochoa, Gabriela; Whitley, Darrell; Tinós, Renato
Source: Proceedings. Conference titles: Genetic and Evolutionary Computation Conference (GECCO). Unidade: FFCLRP
Subjects: INTELIGÊNCIA ARTIFICIAL, APRENDIZADO COMPUTACIONAL, HEURÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CHICANO, Francisco et al. Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search. 2017, Anais.. Berlin: ACM, 2017. Disponível em: https://doi.org/10.1145/3071178.3071285. Acesso em: 16 nov. 2024.
APA
Chicano, F., Ochoa, G., Whitley, D., & Tinós, R. (2017). Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search. In Proceedings. Berlin: ACM. doi:10.1145/3071178.3071285
NLM
Chicano F, Ochoa G, Whitley D, Tinós R. Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search [Internet]. Proceedings. 2017 ;[citado 2024 nov. 16 ] Available from: https://doi.org/10.1145/3071178.3071285
Vancouver
Chicano F, Ochoa G, Whitley D, Tinós R. Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search [Internet]. Proceedings. 2017 ;[citado 2024 nov. 16 ] Available from: https://doi.org/10.1145/3071178.3071285
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: 16 nov. 2024.
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 2024 nov. 16 ] 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 2024 nov. 16 ] Available from: https://doi.org/10.1145/3071178.3071305
Trabalho de evento
Tunnelling crossover networks (2015)
Ochoa, Gabriela; Chicano, Francisco; Tinós, Renato; Whitley, Darrell
Source: Proceedings. Conference titles: Genetic and Evolutionary Computation Conference (GECCO). Unidade: FFCLRP
Subjects: INTELIGÊNCIA ARTIFICIAL, SOLUÇÃO DE PROBLEMAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
OCHOA, Gabriela et al. Tunnelling crossover networks. 2015, Anais.. Madrid: ACM, 2015. . Acesso em: 16 nov. 2024.
APA
Ochoa, G., Chicano, F., Tinós, R., & Whitley, D. (2015). Tunnelling crossover networks. In Proceedings. Madrid: ACM.
NLM
Ochoa G, Chicano F, Tinós R, Whitley D. Tunnelling crossover networks. Proceedings. 2015 ;[citado 2024 nov. 16 ]
Vancouver
Ochoa G, Chicano F, Tinós R, Whitley D. Tunnelling crossover networks. Proceedings. 2015 ;[citado 2024 nov. 16 ]
Trabalho de evento
Partition crossover for pseudo-Boolean optimization (2015)
Tinós, Renato; Whitley, Darrell; Chicano, Francisco
Source: Proceedings. Conference titles: ACM Conference on Foundations of Genetic Algorithms (FOGA'15). Unidade: FFCLRP
Subjects: INTELIGÊNCIA ARTIFICIAL, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TINÓS, Renato e WHITLEY, Darrell e CHICANO, Francisco. Partition crossover for pseudo-Boolean optimization. 2015, Anais.. Aberystwyth: ACM, 2015. Disponível em: https://doi.org/10.1145/2725494.2725497. Acesso em: 16 nov. 2024.
APA
Tinós, R., Whitley, D., & Chicano, F. (2015). Partition crossover for pseudo-Boolean optimization. In Proceedings. Aberystwyth: ACM. doi:10.1145/2725494.2725497
NLM
Tinós R, Whitley D, Chicano F. Partition crossover for pseudo-Boolean optimization [Internet]. Proceedings. 2015 ;[citado 2024 nov. 16 ] Available from: https://doi.org/10.1145/2725494.2725497
Vancouver
Tinós R, Whitley D, Chicano F. Partition crossover for pseudo-Boolean optimization [Internet]. Proceedings. 2015 ;[citado 2024 nov. 16 ] Available from: https://doi.org/10.1145/2725494.2725497

USP Schools

ReP

Filtros

Authors

Subjects

Funding Agencies

Non normalized affiliation

Countries of institutions of collaboration