Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Francesco Quinzan"'
Autor:
Amir Mohammad Karimi Mamaghan, Andrea Dittadi, Stefan Bauer, Karl Henrik Johansson, Francesco Quinzan
Publikováno v:
Entropy, Vol 26, Iss 7, p 556 (2024)
Causal reasoning can be considered a cornerstone of intelligent systems. Having access to an underlying causal graph comes with the promise of cause–effect estimation and the identification of efficient and safe interventions. However, learning cau
Externí odkaz:
https://doaj.org/article/96c8c35d649b4a76978408c26470f586
Publikováno v:
GECCO
In many evolutionary algorithms (EAs), a parameter that needs to be tuned is that of the mutation rate, which determines the probability for each decision variable to be mutated. Typically, this rate is set to 1/n for the duration of the optimization
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3ee139d324d6e9158c0bd99fcc862cf2
https://doi.org/10.1145/3205455.3205515
https://doi.org/10.1145/3205455.3205515
Publikováno v:
GECCO
In the context of black box optimization, one of the most common ways to handle deceptive attractors is to periodically restart the algorithm. In this paper, we explore the benefits of combining the simple (1 + 1) Evolutionary Algorithm (EA) with the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5945385d0c08b877384939c266150b2a
https://doi.org/10.1145/3205455.3205525
https://doi.org/10.1145/3205455.3205525
Publikováno v:
AAAI
We investigate the performance of a deterministic GREEDY algorithm for the problem of maximizing functions under a partition matroid constraint. We consider non-monotone submodular functions and monotone subadditive functions. Even though constrained
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e5944edf47f9fc2ee19527b036c33eec
Publikováno v:
Parallel Problem Solving from Nature – PPSN XV ISBN: 9783319992525
PPSN (1)
PPSN (1)
A core feature of evolutionary algorithms is their mutation operator. Recently, much attention has been devoted to the study of mutation operators with dynamic and non-uniform mutation rates. Following up on this line of work, we propose a new mutati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::66deb4b1e292f880fdbbf5be80cb80e1
https://doi.org/10.1007/978-3-319-99253-2_11
https://doi.org/10.1007/978-3-319-99253-2_11
A core operator of evolutionary algorithms (EAs) is the mutation. Recently, much attention has been devoted to the study of mutation operators with dynamic and non-uniform mutation rates. Following up on this area of work, we propose a new mutation o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7ece06784262cdc050e626626df8ed8
Publikováno v:
FOGA
Noise is pervasive in real-world optimization, but there is still little understanding of the interplay between the operators of randomized search heuristics and explicit noise-handling techniques, such as statistical resampling. In this paper, we re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e85aa94ef5678d05dcf88abc2c31cb51
https://doi.org/10.1145/3040718.3040723
https://doi.org/10.1145/3040718.3040723
Publikováno v:
GECCO
It has been experimentally observed that real-world networks follow certain topological properties, such as small-world, power-law etc. To study these networks, many random graph models, such as Preferential Attachment, have been proposed.In this pap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e8f9eaf1bbbf6f4788f3f346e9743c38