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 …
network management and limits the development of network functions. Software-Defined …
An improved master-apprentice evolutionary algorithm for minimum independent dominating set problem
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 …
dominating set with some other applications. In this work, we present an improved master …
ImgSensingNet: UAV vision guided aerial-ground air quality sensing system
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 …
urban areas has drawn considerable attention. This paper presents ImgSensingNet, a vision …
[HTML][HTML] The many facets of upper domination
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 …
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …
Personalized search for social media via dominating verbal context
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 …
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
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 …
of finding a maximal knapsack packing that minimizes the profit of the selected items. We …
[HTML][HTML] On the max min vertex cover problem
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 …
studied min independent dominating set problem, known to be NP-hard and highly …
A path cost-based GRASP for minimum independent dominating set problem
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 …
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 …
quantum algorithms are increasingly being employed to address a myriad of combinatorial …
Multiple radii disc diversity: Result diversification based on dissimilarity and coverage
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 …
quality of results retrieved by user queries. In this article, we introduce a novel definition of …