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

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. Computer scientists often deal with abstract problems that are hard to comprehend, but an exciting new algorithm matters to anyone who ...

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

ABSTRACT: In this paper, we use partial differential equations to deal with constraint optimal control problems. We construct extremal flows by differential-algebraic equation to approximate the ...

The central principle of the proposed MAC determination method is to connect the batteries within an RBS in parallel to the maximum possible extent, thereby maximizing the output current. To achieve ...