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 team used an AI method known as equation discovery to develop a model to simulate the interactions between small eddies—circular, vortex-like currents—and large-scale ones. These interactions are ...

Over the years, data centers have reinvented themselves through virtualization, the cloud and AI. The next iteration is quantum. However, the future will not be binary, but hybrid, with infrastructure ...

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 ...

We study the problem of estimating the size of a maximum matching in sublinear time. The problem has been studied extensively in the literature and various algorithms and lower bounds are known for it ...

A new wave of “reasoning” systems from companies like OpenAI is producing incorrect information more often. Even the companies don’t know why. Credit...Erik Carter Supported by By Cade Metz and Karen ...

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 ...