Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
The 2- 1 sparse signal minimization problem can be solved efficiently by gradient projection. In many applications, the signal to be estimated is known to lie in some range of va...
James Hernandez, Zachary T. Harmany, Daniel Thomps...
Constrained random simulation is the main workhorse in today’s hardware verification flows. It requires the random generation of input stimuli that obey a set of declaratively...
—In this paper, we study the joint power and channel resource allocation problem for a multiuser F/TDMA decodeand-forward (DF) relay network under per-node power constraints and ...
Yin Sun, Yuanzhang Xiao, Ming Zhao 0001, Xiaofeng ...