Data is often referred to as the new oil of the digital economy, representing a highly valuable and untapped asset. To fully realize the potential of spatial data, various spatial data marketplace ...

Abstract: Identifying positive influence dominating set (PIDS) with the smallest cardinality can produce positive effect with the minimal cost on a social network. The purpose of this article is to ...

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...

Using an advanced Monte Carlo method, Caltech researchers found a way to tame the infinite complexity of Feynman diagrams and solve the long-standing polaron problem, unlocking deeper understanding of ...

A fully dynamic algorithm for the NP-complete maximum weight and maximum cardinality independent set problem. We introduce optimal neighborhood exploration, a novel local search technique that creates ...

Abstract: Finding the shortest vector in a lattice is a NP-hard problem. The best known approximation algorithm for this problem is LLL algorithm with the approximation factor of αn-1\2, α≥4\3, which ...

What would you like to Propose? Hey I saw a Feature Request for Edmond Algorithm and wanted to add another Algorithm - Edmonds Blossom Algorithm, under the data structure/graphs The Edmonds Blossom ...

An international research team has developed a particle swarm optimization (PSO) algorithm based on quantum computing for real-time maximum power point tracking (MPPT) implementation in PV systems.

A group of researchers from Lanzhou Jiaotong University in China has developed a maximum power point tracking (MPPT) technique based on an improved snake optimizer (ISO) algorithm. The ISO is a ...