Pareto-like sequential sampling heuristic for global optimisation
Related publications (39)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
The performance of evolutionary algorithms can be heavily undermined when constraints limit the feasible areas of the search space. For instance, while Covariance Matrix Adapta- tion Evolution Strategy is one of the most efficient algorithms for unconstrai ...
Institute of Electrical and Electronics Engineers2016
This paper investigates the performance of 6 versions of Covariance Matrix Adaptation Evolution Strategy (CMAES) with restarts on a set of 28 noiseless optimization problems (including 23 multi-modal ones) designed for the special session on real-parameter ...
Finding convergence rates for numerical optimization algorithms is an important task, because it gives a justification to their use in solving practical problems, while also providing a way to compare their efficiency. This is especially useful in an async ...
The identification of effective and long-lasting cancer therapies still remains elusive, partially due to patient and tumor heterogeneity, acquired drug resistance, and single-drug dose-limiting toxicities. The use of drug combinations may help to overcome ...
The design of a microvascular flow network embedded in an actively-cooled polymeric material is presented. A multi-objective Genetic Algorithm (GA) combined with the finite element method is first used to determine the quasi-optimized network configuration ...
The Ranger robot was designed to interact with children in order to motivate them to tidy up their room. Its mechanical configuration, together with the limited field of view of its depth camera, make the learning of obstacle avoidance behaviors a hard pro ...
Euclidean distance matrices (EDMs) are matrices of the squared distances between points. The definition is deceivingly simple; thanks to their many useful properties, they have found applications in psychometrics, crystallography, machine learning, wireles ...
In this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem ...
Natural and artificial societies often divide the workload between specialized members. For example, an ant worker may preferentially perform one of many tasks such as brood rearing, foraging and nest maintenance. A robot from a rescue team may specialize ...
This paper investigates the performance of 6 versions of Covariance Matrix Adaptation Evolution Strategy (CMA-ES) with restarts on a set of 28 noiseless optimization problems (including 23 multi-modal ones) designed for the special session on real-paramete ...