USING STRATEGY IMPROVEMENT TO STAY ALIVE

2012 ◽  
Vol 23 (03) ◽  
pp. 585-608 ◽  
Author(s):  
LUBOŠ BRIM ◽  
JAKUB CHALOUPKA

We design a novel algorithm for solving Mean-Payoff Games (MPGs). Besides solving an MPG in the usual sense, our algorithm computes more information about the game, information that is important with respect to applications. The weights of the edges of an MPG can be thought of as a gained/consumed energy – depending on the sign. For each vertex, our algorithm computes the minimum amount of initial energy that is sufficient for player Max to ensure that in a play starting from the vertex, the energy level never goes below zero. Our algorithm is not the first algorithm that computes the minimum sufficient initial energies, but according to our experimental study it is the fastest algorithm that computes them. The reason is that it utilizes the strategy improvement technique which is very efficient in practice.

Author(s):  
Massimo Benerecetti ◽  
Daniele Dell’Erba ◽  
Fabio Mogavero

Abstract We propose a novel algorithm for the solution of mean-payoff games that merges together two seemingly unrelated concepts introduced in the context of parity games, small progress measures and quasi dominions. We show that the integration of the two notions can be highly beneficial and significantly speeds up convergence to the problem solution. Experiments show that the resulting algorithm performs orders of magnitude better than the asymptotically-best solution algorithm currently known, without sacrificing on the worst-case complexity.


2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Yuxuan Chen ◽  
Jiangbo Han

<p style='text-indent:20px;'>In this paper, we consider a class of finitely degenerate coupled parabolic systems. At high initial energy level <inline-formula><tex-math id="M1">\begin{document}$ J(u_{0})&gt;d $\end{document}</tex-math></inline-formula>, we present a new sufficient condition to describe the global existence and nonexistence of solutions for problem (1)-(4) respectively. Moreover, by applying the Levine's concavity method, we give some affirmative answers to finite time blow up of solutions at arbitrary positive initial energy <inline-formula><tex-math id="M2">\begin{document}$ J(u_{0})&gt;0 $\end{document}</tex-math></inline-formula>, including the estimate of upper bound of blowup time.</p>


2021 ◽  
Vol 248 ◽  
pp. 04002
Author(s):  
Alexander Metel ◽  
Enver Mustafaev ◽  
Yury Melnik ◽  
Khaled Hamdy

We present results of theoretical and experimental study of collisional relaxation of fast electrons energy in gas. The dependence on the gas pressure p and electron energy ε of the mean pass Λ of fast electrons injected into a gas being sufficient to spend on ionization all their initial energy ε has been calculated. It was found that Λ is directly proportional to ε2 and inversely proportional to the gas pressure. To sustain glow discharge with electrostatic confinement of fast electrons, Λ should be less than the mean way to the anode of emitted by the cathode electrons.


Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Xingyu Miao ◽  
Jiayuan Wei ◽  
Yongqi Ge

When the energy-harvesting embedded system (EHES) is running, its available energy (harvesting energy and battery storage energy) seems to be sufficient overall. However, in the process of EHES task execution, an energy shortage may occur in the busy period such that system tasks cannot be scheduled. We call this issue the energy deception (ED) of the EHES. Aiming to address the ED issue, we design an appropriate initial energy level of the battery. In this paper, we propose three algorithms to judge the feasibility of the task set and calculate the appropriate initial energy level of the battery. The holistic energy evaluation (HEE) algorithm makes a preliminary judgment of the task set feasibility according to available energy and consumption energy. A worst-case response time-based initial energy level of the battery (WCRT-IELB) algorithm and an accurate cycle-initial energy level of the battery (AC-IELB) algorithm can calculate the proper initial battery capacity. We use the YARTISS tool to simulate the above three algorithms. We conducted 250 experiments on As Late As Possible (ALAP) and As Soon As Possible (ASAP) scheduling with the maximum battery capacities of 50, 100, 200, 300, and 400. The experimental results show that setting a reasonable initial energy level of the battery can effectively improve the feasibility of the task set. Among the 250 task sets, the HEE algorithm filtered 2.8% of them as infeasible task sets. When the battery capacity is set to 400, the WCRT-BIEL algorithm increases the success rates of the ALAP and ASAP by 17.2% and 26.8%, respectively. The AC-BIEL algorithm increases the success rates of the ALAP and ASAP by 18% and 26.8%, respectively.


2007 ◽  
Vol 145 (3) ◽  
pp. 4967-4974 ◽  
Author(s):  
Y. M. Lifshits ◽  
D. S. Pavlov

Sign in / Sign up

Export Citation Format

Share Document