Controller load optimization strategies in Software-Defined Networking: A survey

Y Liu, Y Ge, Q Meng, Q Liu - Journal of Network and Computer Applications, 2024 - Elsevier
In traditional networks, the static configuration of devices increases the complexity of
network management and limits the development of network functions. Software-Defined …

An improved master-apprentice evolutionary algorithm for minimum independent dominating set problem

S Pan, Y Ma, Y Wang, Z Zhou, J Ji, M Yin… - Frontiers of Computer …, 2023 - Springer
The minimum independent dominance set (MIDS) problem is an important version of the
dominating set with some other applications. In this work, we present an improved master …

ImgSensingNet: UAV vision guided aerial-ground air quality sensing system

Y Yang, Z Hu, K Bian, L Song - IEEE INFOCOM 2019-IEEE …, 2019 - ieeexplore.ieee.org
Given the increasingly serious air pollution problem, air quality index (AQI) monitoring in
urban areas has drawn considerable attention. This paper presents ImgSensingNet, a vision …

[HTML][HTML] The many facets of upper domination

C Bazgan, L Brankovic, K Casel, H Fernau… - Theoretical Computer …, 2018 - Elsevier
The many facets of upper domination - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …

Personalized search for social media via dominating verbal context

H Xie, X Li, T Wang, L Chen, K Li, FL Wang, Y Cai, Q Li… - Neurocomputing, 2016 - Elsevier
With the rapid development of Web 2.0 communities, there has been a tremendous increase
in user-generated content. Confronting such a vast volume of resources in collaborative …

An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem

F Furini, I Ljubić, M Sinnl - European journal of operational research, 2017 - Elsevier
Given a set of items with profits and weights and a knapsack capacity, we study the problem
of finding a maximal knapsack packing that minimizes the profit of the selected items. We …

[HTML][HTML] On the max min vertex cover problem

N Boria, F Della Croce, VT Paschos - Discrete Applied Mathematics, 2015 - Elsevier
We address the max min vertex cover problem, which is the maximization version of the well
studied min independent dominating set problem, known to be NP-hard and highly …

A path cost-based GRASP for minimum independent dominating set problem

Y Wang, R Li, Y Zhou, M Yin - Neural Computing and Applications, 2017 - Springer
The minimum independent dominating set problem (MIDS) is an extension of the classical
dominating set problem with wide applications. In this paper, we describe a greedy …

[HTML][HTML] Solving the Independent Domination Problem by the Quantum Approximate Optimization Algorithm

H Pan, C Lu - Entropy, 2024 - mdpi.com
In the wake of quantum computing advancements and quantum algorithmic progress,
quantum algorithms are increasingly being employed to address a myriad of combinatorial …

Multiple radii disc diversity: Result diversification based on dissimilarity and coverage

M Drosou, E Pitoura - ACM Transactions on Database Systems (TODS), 2015 - dl.acm.org
Recently, result diversification has attracted a lot of attention as a means to improve the
quality of results retrieved by user queries. In this article, we introduce a novel definition of …