Efficient multiverse electro search optimization for multi-cloud task scheduling and resource allocation
R Ravi, MJ Pillai - Multimedia Tools and Applications, 2024 - Springer
Effective task scheduling and resource allocation have become major problems as a result
of the fast development of cloud computing as well as the rise of multi-cloud systems. To …
of the fast development of cloud computing as well as the rise of multi-cloud systems. To …
[HTML][HTML] Probabilistic Cellular Automata Monte Carlo for the Maximum Clique Problem
A Troiani - Mathematics, 2024 - mdpi.com
We consider the problem of finding the largest clique of a graph. This is an NP-hard problem
and no exact algorithm to solve it exactly in polynomial time is known to exist. Several …
and no exact algorithm to solve it exactly in polynomial time is known to exist. Several …
From Maximum Cut to Maximum Independent Set
The Maximum Cut (Max-Cut) problem could be naturally expressed either in a Quadratic
Unconstrained Binary Optimization (QUBO) formulation, or as an Ising model. It has long …
Unconstrained Binary Optimization (QUBO) formulation, or as an Ising model. It has long …
Quantum computing and the stable set problem
A Krpan, J Povh, D Pucher - arXiv preprint arXiv:2405.12845, 2024 - arxiv.org
Given an undirected graph, the stable set problem asks to determine the cardinality of the
largest subset of pairwise non-adjacent vertices. This value is called the stability number of …
largest subset of pairwise non-adjacent vertices. This value is called the stability number of …