Computational sprinting is a class of mechanisms that boost performance but dissipate additional power. We describe a sprinting architecture in which many, independent chip multiprocessors share a power supply and sprints are constrained by the chips’ thermal limits and the rack’s power limits. Moreover, we present the computational sprinting game, a multi-agent perspective on managing sprints....

This work proposes a non-cooperative joint modulation, rate, and power control game-theoretic approach for the uplink of a single cell CDMA system. A generalized approach towards adaptive modulation is introduced, by fitting different efficiency functions of several modulations by means of the Gompertz sigmoid functions. The existence of a Nash equilibrium as well as the best response strategie...

a {em roman dominating function} on a graph $g = (v ,e)$ is a function $f : vlongrightarrow {0, 1, 2}$ satisfying the condition that every vertex $v$ for which $f (v) = 0$ is adjacent to at least one vertex $u$ for which $f (u) = 2$. the {em weight} of a roman dominating function is the value $w(f)=sum_{vin v}f(v)$. the roman domination number of a graph $g$, denoted by $gamma_r(g)$, equals the...

With the increasing penetration of renewable energy in power systems, fluctuation of renewable energy power plants has great influence on stability of the system, and renewable power curtailment is also becoming more and more serious due to the insufficient consumptive ability of local power grid. In order to maximize the utilization of renewable energy, this paper focuses on the generation sch...

Spectrum sharing deployment of femtocells brings interferences which dramatically degrade network performance. Hence, interference control is a crucial challenge for femtocell networks. In this paper, we propose power optimization approach 5G networks consisting macrocell and underlying to manage the interference. Firstly, formulate problem based on non-cooperative game analyze competition amon...

We study the power index voting game design problem for weighted voting games: the problem of finding a weighted voting game in which the power of the players is as close as possible to a certain target distribution. Our goal is to find algorithms that solve this problem exactly. Thereto, we consider various subclasses of simple games, and their associated representation methods. We survey algo...

This paper discusses the power allocation with fixed rate constraint problem in multi-carrier code division multiple access (MC-CDMA) networks, that has been solved through game theoretic perspective by the use of an iterative waterfilling algorithm (IWFA). The problem is analyzed under various interference density configurations, and its reliability is studied in terms of solution existence an...

Generalizing from many of actual problems, this paper puts forward the game: boating against the current, discusses the related assumptions and analyzes the related characters of it. Further more, the author gives the dispersed and continuous models for boating against the current Based on the Partial Distribution. It is worth to say that the game of boating against the current is a representat...