From a rare events perspective, scheduling disciplines that work well under light (exponential) tailed workload distributions do not perform well under heavy (power) tailed workload distributions, and vice-versa, leading to fundamental problems in
One of the early motivations for current interest in the stochastic networks community in the study of network models involving long-range-dependent stochastic processes was the observation, based on statistical analysis of data, that variable-bit
In SocG 2009, Mustafa and Ray showed that a local search algorithm is, somewhat surprisingly, a PTAS for certain geometric set cover/hitting set problems.
As computers and networked systems have become an integral part of our daily lives, securing information from unauthorized access, misuse and modification has become very important.
Given a collection of vertices in a network, the problem of finding the minimum cost sub-network connecting a set of client nodes to a dedicated hub-node is the Steiner tree problem. Consider the following two twists.
The computer industry is at a major inflection point in its hardware roadmap due to the end of a decades-long trend of exponentially increasing clock frequencies.
Given a simplicial complex with weights on its simplices, and a nontrivial cycle on it, we are interested in finding the cycle with minimal weight which is homologous to the given one.
The Euclidean shortest path problem in a polygonal region is one of the oldest and best-known in Computational Geometry due to its various applications.
