Sciweavers

1410 search results - page 94 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
TSP
2010
14 years 6 months ago
Cooperative resource allocation games under spectral mask and total power constraints
Resource allocation problems in multi-user systems, modeled as Nash bargaining (NB) cooperative games, are investigated under different constraints. Using the joint time division m...
Jie Gao, Sergiy A. Vorobyov, Hai Jiang
ICASSP
2009
IEEE
15 years 6 months ago
Game theory for precoding in a multi-user system: Bargaining for overall benefits
A precoding strategy for multi-user spectrum sharing over an interference channel is proposed and analyzed from a game-theoretic perspective. The proposed strategy is based on fi...
Jie Gao, Sergiy A. Vorobyov, Hai Jiang
73
Voted
PIMRC
2008
IEEE
15 years 5 months ago
A game theoretic framework for decentralized power allocation in IDMA systems
Abstract—In this contribution we present a decentralized power allocation algorithm for the uplink interleave division multiple access (IDMA) channel. Within the proposed optimal...
Samir Medina Perlaza, Laura Cottatellucci, M&eacut...
FM
2008
Springer
148views Formal Methods» more  FM 2008»
15 years 26 days ago
Precise Interval Analysis vs. Parity Games
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
Thomas Gawlitza, Helmut Seidl
FSTTCS
2007
Springer
15 years 5 months ago
Undirected Graphs of Entanglement 2
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
Walid Belkhir, Luigi Santocanale