Sciweavers

473 search results - page 17 / 95
» A distributed Newton method for Network Utility Maximization
Sort
View
GLOBECOM
2008
IEEE
14 years 10 months ago
Cooperative Spectrum Allocation in Centralized Cognitive Networks Using Bipartite Matching
—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,...
EMMCVPR
2003
Springer
15 years 2 months ago
Asymptotic Characterization of Log-Likelihood Maximization Based Algorithms and Applications
The asymptotic distribution of estimates that are based on a sub-optimal search for the maximum of the log-likelihood function is considered. In particular, estimation schemes that...
Doron Blatt, Alfred O. Hero
INFOCOM
2010
IEEE
14 years 8 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
ICA3PP
2005
Springer
15 years 3 months ago
GridMD: Program Architecture for Distributed Molecular Simulation
In the present work we describe architectural concepts of the distributed molecular simulation package GridMD. The main purpose of this work is to underline the construction patter...
Ilya Valuev
ATAL
2005
Springer
15 years 3 months ago
Modeling complex multi-issue negotiations using utility graphs
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
Valentin Robu, D. J. A. Somefun, Johannes A. La Po...