Abstract: Let /spl chi//sub n/=(x/sub 1/,...,x/sub n/), be an independent and identically distributed (i.i.d.) sample having multivariate distribution P. We derive almost sure (a.s.) limits for the ...

Crunching hard grains together leads to their rigidification, irrespective of how the system is prepared. While certain features of the resulting jammed materials—e.g. their contact force distribution ...

In 2022, a team of computer scientists presented a groundbreaking algorithm for the maximum flow problem: How does one transport the most supplies from a source node to a sink node in a network while ...

Finding bipartite matchings is one of the oldest and most well-studied problems in computer science. This problem comes up in many guises, such as when matching donors to recipients for organ ...

In response to the shortcomings of the Salp Swarm Algorithm (SSA) such as low convergence accuracy and slow convergence speed, a Multi-Strategy-Driven Salp Swarm Algorithm (MSD-SSA) was proposed.

Clustering is usually the first exploratory analysis step in empirical data. When the data set comprises graphs, the most common approaches focus on clustering its vertices. In this work, we are ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...