Stochastic sensor scheduling via distributed convex optimization

C Li, N Elia - Automatica, 2015 - Elsevier
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 …

String submodular functions with curvature constraints

Z Zhang, EKP Chong, A Pezeshki… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
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 …

Maximizing sequence-submodular functions and its application to online advertising

S Alaei, A Makhdoumi, A Malekian - Management Science, 2021 - pubsonline.informs.org
Motivated by applications in online advertising, we consider a class of maximization
problems where the objective is a function of the sequence of actions and the running …

Ranking with submodular functions on a budget

G Zhang, N Tatti, A Gionis - Data mining and knowledge discovery, 2022 - Springer
Submodular maximization has been the backbone of many important machine-learning
problems, and has applications to viral marketing, diversification, sensor placement, and …

Robust sequence submodular maximization

G Sallam, Z Zheng, J Wu, B Ji - Advances in Neural …, 2020 - proceedings.neurips.cc
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 …

Directional sensor control: Heuristic approaches

S Ragi, HD Mittelmann, EKP Chong - IEEE Sensors Journal, 2014 - ieeexplore.ieee.org
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 …

Learning in hierarchical social networks

Z Zhang, EKP Chong, A Pezeshki… - IEEE Journal of …, 2013 - ieeexplore.ieee.org
We study a social network consisting of agents organized as a hierarchical M-ary rooted
tree, common in enterprise and military organizational structures. The goal is to aggregate …

Near optimality of greedy strategies for string submodular functions with forward and backward curvature constraints

Z Zhang, Z Wang, EKP Chong… - … IEEE Conference on …, 2013 - ieeexplore.ieee.org
The problem of choosing a string of actions to optimize an objective function that is string
submodular has been considered in [1]. There it is shown that the greedy strategy …

A novel multistage decision fusion for cognitive sensor networks using AND and OR rules

K Gupta, SN Merchant, UB Desai - Digital Signal Processing, 2015 - Elsevier
We propose a centralized radix-2 multistage decision fusion strategy comprising simple
AND and OR rules for cooperative spectrum sensing in cognitive sensor networks. Earlier …

Near-optimal distributed detection in balanced binary relay trees

Z Zhang, EKP Chong, A Pezeshki… - … on Control of …, 2016 - ieeexplore.ieee.org
We study the distributed detection problem in a balanced binary relay tree, where the leaves
of the tree are sensors generating binary messages. The root of the tree is a fusion center …