Abstract: We propose a new objective function for clustering. This objective function consists of two components: the entropy rate of a random walk on a graph and a balancing term. The entropy rate ...

Abstract: We consider a class of distributed submodular maximization problems in which each agent must choose a single strategy from its strategy set. The global objective is to maximize a submodular ...

A network optimizer that decides which inbound containers to unload, on which day, and to which building, so that the most demand is covered at a target service level under a daily unloading limit. It ...