—Conflict free spectrum allocation for secondary users in cognitive networks is a challenging problem, since the accessible spectrum is shared among users. The problem becomes to...
Chengshi Zhao, Mingrui Zou, Bin Shen, Bumjung Kim,...
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
We introduce XPORT, a profile-driven distributed data dissemination system that supports an extensible set of data types, profile types, and optimization metrics. XPORT efficientl...
The problem of multi-target tracking is comprised of two distinct, but tightly coupled challenges: (i) the naturally discrete problem of data association, i.e. assigning image obs...
An algorithm is presented for wheeled mobile robot trajectory generation that achieves a high degree of generality and efficiency. The generality derives from numerical lineariza...