Sciweavers

202 search results - page 23 / 41
» sum 2009
Sort
View
DAM
2006
59views more  DAM 2006»
13 years 10 months ago
Optimal strategies for equal-sum dice games
In this paper we consider a non-cooperative two-person zero-sum matrix game, called dice game. In an (n, ) dice game, two players can independently choose a dice from a collection...
Bart De Schuymer, Hans De Meyer, Bernard De Baets
CONCUR
2009
Springer
14 years 4 months ago
Probabilistic Weighted Automata
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
GLOBECOM
2009
IEEE
13 years 7 months ago
A Low-Complexity Algorithm for Uplink Scheduling in Cooperative Cellular Networks with a Capacity-Constrained Backhaul Infrastru
Today, it is well understood that interference poses the main capacity limitation and thus challenge for future cellular networks. A promising concept that addresses interference i...
Fabian Diehm, Patrick Marsch, Gerhard Fettweis, Bh...
LICS
2009
IEEE
14 years 4 months ago
Expressiveness and Closure Properties for Quantitative Languages
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 4 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking