Search Results for author:
Found 9 papers, 2 papers with code
CMSA algorithm for solving the prioritized pairwise test data generation problem in software product lines
In Software Product Lines (SPLs) it may be difficult or even impossible to test all the products of the family because of the large number of valid feature combinations that may exist.
NK Hybrid Genetic Algorithm for Clustering
Mutation operators, a partition crossover, and a local search strategy are proposed, all using information about the relationship between decision variables.
Using metaheuristics for the location of bicycle stations
In this work, we solve the problem of finding the best locations to place stations for depositing/collecting shared bicycles.
Dynastic Potential Crossover Operator
In this paper, we present a recombination operator, called Dynastic Potential Crossover (DPX), that runs in polynomial time and behaves like an optimal recombination operator for low-epistasis combinatorial problems.
Effective anytime algorithm for multiobjective combinatorial optimization problems
In multiobjective optimization, the result of an optimization algorithm is a set of efficient solutions from which the decision maker selects one.
Optimising Communication Overhead in Federated Learning Using NSGA-II
Federated learning is a training paradigm according to which a server-based model is cooperatively trained using local models running on edge devices and ensuring data privacy.
Efficient Hill-Climber for Multi-Objective Pseudo-Boolean Optimization
Local search can be a stand along search methods, but it can also be hybridized with evolutionary algorithms.
Optimal Neuron Selection: NK Echo State Networks for Reinforcement Learning
This paper introduces the NK Echo State Network.
A Hitchhiker's Guide to Search-Based Software Engineering for Software Product Lines
Search Based Software Engineering (SBSE) is an emerging discipline that focuses on the application of search-based optimization techniques to software engineering problems.
