Abstract: In this paper, we propose the Priority Facility Location Problem with Outliers (PFLPO), which is a generalization of both the Facility Location Problem with Outliers (FLPO) and Priority ...

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

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

ABSTRACT: Fractional-order time-delay differential equations can describe many complex physical phenomena with memory or delay effects, which are widely used in the fields of cell biology, control ...

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.

Adam Satariano and Roser Toll Pifarre interviewed more than 50 victims, families, police, government officials and other experts about Spain’s gender violence program. In a small apartment outside ...

Computer scientists have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum transport costs for ...

We benchmark Quantum Annealing (QA) vs. Simulated Annealing (SA) with a focus on the impact of the embedding of problems onto the different topologies of the D-Wave quantum annealers. The series of ...