Multi-strategy ensemble artificial bee colony algorithm
Artificial bee colony (ABC) is a recently proposed optimization technique which has shown
to be competitive to other population-based stochastic algorithms. However, ABC is good at …
to be competitive to other population-based stochastic algorithms. However, ABC is good at …
An effective gbest-guided gravitational search algorithm for real-parameter optimization and its application in training of feedforward neural networks
Gravitational search algorithm (GSA) is a recently introduced meta-heuristic that has shown
great performance in numerical function optimization and solving real world problems. GSA …
great performance in numerical function optimization and solving real world problems. GSA …
A new local search algorithm with greedy crossover restart for the dominating tree problem
The dominating tree problem (DTP), a variant of the classical minimum dominating set
problem, aims to find a dominating tree of minimum costs on a given connected, undirected …
problem, aims to find a dominating tree of minimum costs on a given connected, undirected …
Artifical bee colony algorithm using problem-specific neighborhood strategies for the tree t-spanner problem
A tree t-spanner is a spanning tree T in which the ratio of distance between every pair of
vertices is at most t times their shortest distance in a connected graph, where t is a value …
vertices is at most t times their shortest distance in a connected graph, where t is a value …
An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
G Lin, J Guan, H Feng - Physica A: Statistical Mechanics and its …, 2018 - Elsevier
The positive influence dominating set problem is a variant of the minimum dominating set
problem, and has lots of applications in social networks. It is NP-hard, and receives more …
problem, and has lots of applications in social networks. It is NP-hard, and receives more …
Data-driven educational algorithms pedagogical framing
D Domínguez Figaredo - Revista Iberoamericana de Educación a …, 2020 - papers.ssrn.com
Data from students and learning practices are essential for feeding the artificial intelligence
systems used in education. Recurrent data trains the algorithms so that they can be adapted …
systems used in education. Recurrent data trains the algorithms so that they can be adapted …
Minimum cost dominating tree sensor networks under probabilistic constraints
There is an increasing interest in planning sensor networks by considering both the impact
of distances among sensors and the risk that power consumption leads to a very small …
of distances among sensors and the risk that power consumption leads to a very small …
A hybrid framework combining genetic algorithm with iterated local search for the dominating tree problem
S Hu, H Liu, X Wu, R Li, J Zhou, J Wang - Mathematics, 2019 - mdpi.com
Given an undirected, connected and edge-weighted graph, the dominating tree problem
consists of finding a tree with minimum total edge weight such that for each vertex is either in …
consists of finding a tree with minimum total edge weight such that for each vertex is either in …
Improved solution strategies for dominating trees
Abstract Intelligent systems in Wireless Sensor Networks (WSN) allow to eliminate
duplicated sensed data and to efficiently route them to a central processing unit. Thus …
duplicated sensed data and to efficiently route them to a central processing unit. Thus …
A two-level meta-heuristic approach for the minimum dominating tree problem
C **ong, H Liu, X Wu, N Deng - Frontiers of Computer Science, 2023 - journal.hep.com.cn
The minimum dominating tree (MDT) problem was first proposed by Zhang et al.[1] to
produce a routing backbone of a WSN. Shin et al.[2] proved that the MDT problem is NP …
produce a routing backbone of a WSN. Shin et al.[2] proved that the MDT problem is NP …