Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...
—This review article explores the notion of radio flexibility, its various versions (as presented in a brief taxonomy) and its efficient instantiations under various metrics, pri...
The explosive growth of new multimedia services over the Internet necessitates efficient network management. Improved network management systems are expected to simultaneously prov...
We consider a general model of stochastic discrete event systems with asynchronous events, and propose to develop efficient algorithms for verification and control of such systems...
We give efficient algorithms for computing a minimum-perimeter k-gon that encloses a given n-gon. Key words: Computational Geometry, Polygon Optimization