In this paper, we describe a stabilization method for linear time-delay systems which extends the classical pole placement method for ordinary di7erential equations. Unlike methods based on :nite spectrum assignment, our method does not render the closed loop system, :nite dimensional but consists of controlling the rightmost eigenvalues. Because these are moved to the left half plane in a (qua...

Terrain Guarding Problem(TGP), which is known to be NP-complete, asks to find a smallest set of guard locations on a terrain T such that every point on T is visible by a guard. Here, we study this problem on 1.5D orthogonal terrains where the edges are bound to be horizontal or vertical. We propose a 2-approximation algorithm that runs in O(n logm) time, where n and m are the sizes of input and...

We propose a new computational model for the study of massive data processing. Our measures complexity reading input in terms their very large size N and analyzes cost parameter k that characterizes power provided by limited local computing resources. develop algorithmic techniques solving well-known problems on model. In particular, randomized algorithms running time O(N+g1(k)) space O(k2), wi...