In this paper, we propose a stochastic scheduling strategy for estimating the states of N
discrete-time linear time invariant (DTLTI) dynamic systems, where only one system can be …

Consider the problem of choosing a string of actions to optimize an objective function that is
string submodular. It was shown in previous papers that the greedy strategy, consisting of a …

Submodularity is an important property of set functions and has been extensively studied in
the literature. It models set functions that exhibit a diminishing returns property, where the …

We study the problem of controlling multiple 2-D directional sensors while maximizing an
objective function based on the information gain corresponding to multiple target locations …

In this paper, we study the Robust optimization for sequence Networked submodular
maximization (RoseNets) problem. We interweave the robust optimization with the sequence …

We develop polynomial-time heuristic methods to solve unimodular quadratic program
(UQP) approximately, which is a known non-deterministic polynomial-time hard (NP-hard) …

In this paper, we examine adaptive compression policies, when the sequence of vector-
valued measurements to be compressed is noisy and the compressed variables are …

We consider an optimization problem where the decision variable is a string of bounded
length. For some time there has been an interest in bounding the performance of the greedy …

We develop polynomial-time heuristic methods to solve unimodular quadratic programming
(UQP) approximately, which is known to be NP-hard. In the UQP framework, we maximize a …

Suppose that there is a ground set which consists of a large number of vectors in a Hilbert
space. Consider the problem of selecting a subset of the ground set such that the projection …