Sciweavers

915 search results - page 92 / 183
» Maximally Abstract Retrenchments
Sort
View
CORR
2008
Springer
217views Education» more  CORR 2008»
14 years 12 months ago
A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks
Abstract-- This paper introduces a novel concept from coalitional game theory which allows the dynamic formation of coalitions among wireless nodes. A simple and distributed merge ...
Walid Saad, Zhu Han, Mérouane Debbah, Are H...
CORR
2008
Springer
115views Education» more  CORR 2008»
14 years 12 months ago
Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio Channels
Abstract--In this paper, the sum capacity of the Gaussian Multiple Input Multiple Output (MIMO) Cognitive Radio Channel (MCC) is expressed as a convex problem with finite number of...
Rajiv Soundararajan, Sriram Vishwanath
DEDS
2010
88views more  DEDS 2010»
14 years 12 months ago
Optimal Admission Control of Discrete Event Systems with Real-Time Constraints
Abstract-- The problem of optimally controlling the processing rate of tasks in Discrete Event Systems (DES) with hard real-time constraints has been solved in [9] under the assump...
Jianfeng Mao, Christos G. Cassandras
EM
2010
134views Management» more  EM 2010»
14 years 12 months ago
High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
Abstract. The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and...
Hans D. Mittelmann, Frank Vallentin
ACTA
2006
70views more  ACTA 2006»
14 years 12 months ago
Throughput analysis in wireless networks with multiple users and multiple channels
Abstract We consider the problem of maximizing throughput in a multi-carrier wireless network that employs predictive link adaptation. We explicitly consider the time-penalty incur...
Amrinder Arora, Fanchun Jin, Gokhan Sahin, Hosam M...