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

The original version of this story appeared in Quanta Magazine. For computer scientists, solving problems is a bit like mountaineering. First they must choose a problem to solve—akin to identifying a ...

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

ABSTRACT: In this paper we compare track data association purity, accuracy, and timing on a simple, idealized model tracking problem for two data association methods: Global Nearest Neighbor (GNN) and ...

The U.S. Department of Defense is a mammoth organization. It not only employs millions of service members and hundreds of thousands of civilian employees, but also has the world’s largest military ...

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.

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