Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...
Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Pr...
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...