Zobrazeno 1 - 10
of 83
pro vyhledávání: '"Juan Luis, Jiménez Laredo"'
Publikováno v:
PLoS ONE, Vol 17, Iss 5, p e0268380 (2022)
Unlike spiking neurons which compress continuous inputs into digital signals for transmitting information via action potentials, non-spiking neurons modulate analog signals through graded potential responses. Such neurons have been found in a large v
Externí odkaz:
https://doaj.org/article/47e5ae2329d34dd5a9b896ba1d198a0f
Publikováno v:
Neural Computation. 34:2075-2101
Due to the ubiquity of spiking neurons in neuronal processes, various simple spiking neuron models have been proposed as an alternative to conductance-based models (a.k.a. Hodgkin-Huxley–type models), known to be computationally expensive and diffi
Publikováno v:
Applications of Evolutionary Computation ISBN: 9783031024610
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe6b134754f97dff60f8e3aa632fbecc
https://doi.org/10.1007/978-3-031-02462-7_2
https://doi.org/10.1007/978-3-031-02462-7_2
Publikováno v:
PloS one. 17(5)
Unlike spiking neurons which compress continuous inputs into digital signals for transmitting information via action potentials, non-spiking neurons modulate analog signals through graded potential responses. Such neurons have been found in a large v
Publikováno v:
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation, Elsevier, 2020, 58, pp.100721. ⟨10.1016/j.swevo.2020.100721⟩
Swarm and Evolutionary Computation, Elsevier, 2020, 58, pp.100721. ⟨10.1016/j.swevo.2020.100721⟩
Cellular evolutionary algorithms (cEAs) are a particular type of EAs in which a communication structure is imposed to the population and mating restricted to topographically nearby individuals. In general, these algorithms have longer takeover times
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6a23edb0e1428609d39174067f8ef65
https://hal.archives-ouvertes.fr/hal-03352866
https://hal.archives-ouvertes.fr/hal-03352866
Publikováno v:
Applications of Evolutionary Computation ISBN: 9783030437213
EvoApplications
EvoApplications
This paper addresses the issue of estimating the computational complexity of optimizing real-coded multimodal functions where the aim is to find all global optima. The proposed complexity method provides a partial answer to this question in the form
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1dbc7bff7e5c2e2d1b0642530127abfa
https://doi.org/10.1007/978-3-030-43722-0_13
https://doi.org/10.1007/978-3-030-43722-0_13
This book constitutes the refereed proceedings of the 25th International Conference on Applications of Evolutionary Computation, EvoApplications 2022, held as part of Evo•2022, in April 2022, co-located with the Evo•2022 events EuroGP, EvoCOP, an
This book constitutes the refereed proceedings of the 24th International Conference on Applications of Evolutionary Computation, EvoApplications 2021, held as part of Evo•2021, as Virtual Event, in April 2021, co-located with the Evo•2021 events
Autor:
José-Mario García-Valdez, Juan J. Merelo, Juan Luis Jiménez Laredo, Pedro A. Castillo, Sergio Rojas-Galeano
Publikováno v:
Applied Computer Sciences in Engineering-6th Workshop on Engineering Applications, WEA 2019
Applied Computer Sciences in Engineering-6th Workshop on Engineering Applications, WEA 2019, Oct 2019, Santa Marta, Colombia
Communications in Computer and Information Science ISBN: 9783030310189
WEA
Applied Computer Sciences in Engineering-6th Workshop on Engineering Applications, WEA 2019, Oct 2019, Santa Marta, Colombia
Communications in Computer and Information Science ISBN: 9783030310189
WEA
The concept of channel, a computational mechanism used to convey state to different threads of process execution, is at the core of the design of multi-threaded concurrent algorithms. In the case of concurrent evolutionary algorithms, channels can be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eef4d27e527871ed77f8435e35e626b9
https://hal.archives-ouvertes.fr/hal-02332594
https://hal.archives-ouvertes.fr/hal-02332594
Autor:
Mario García Valdez, Sergio Rojas-Galeano, Juan Luis Jiménez Laredo, Pedro A. Castillo, Juan-Julián Merelo Guervós
Publikováno v:
GECCO (Companion)
Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2019
Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2019, Jul 2019, Prague, Czech Republic
Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2019
Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2019, Jul 2019, Prague, Czech Republic
Concurrent evolutionary algorithms use threads that communicate via messages. Parametrizing the work in every thread and the way they communicate results is a major challenge in its design. In this paper we work with concurrent evolutionary algorithm