نتایج جستجو برای: robin hood algorithm

تعداد نتایج: 769390  

Journal: :Texto para Discussão 2021

Despite improvements in the living conditions of population, there has not been a significant change income disparities. Since growth left-wing parties and political competition as per median voter hypothesis do stand Brazilian case, what could explain tenacity inequality country? To answer this, paper, grounded new institutionalism theory, employed process-tracing method to explore causes cont...

2006
Sarah A. Hill William Neilson

We define inequality aversion as a decision-maker disliking it when his opponents’ payoffs differ from his own, diminishing sensitivity as this effect increasing less-than-proportionately as the opponents’ payoffs move further from the decision-maker’s, and a preference for Robin Hood redistributions as a preference for taking money from a high-payoff opponent and giving it to a low-payoff oppo...

Journal: :The bulletin of the International Association for Robin Hood Studies 2022

This article brings posthumanist and new materialist perspectives to bear on the enmeshment of “the human” with among materialities greenwood in early Robin Hood ballads, focusing Monk. The suggests that medieval outlaw tales offer ecocriticism a site within literature not only challenges deconstructs prevailing notions human exceptionalism anthropocentrism, but also portrays forest as storied ...

Journal: :International Journal of Applied Mechanics and Engineering 2017

2017
Kamal ElDahshan Afaf Abd El-kader Nermeen Ghazy

The Round Robin algorithm is a CPU scheduling algorithm that is designed especially for time sharing systems. Each process is assigned a slice of time called time quantum to execute. To increase the performance of a Round Robin algorithm, it is important to choose an optimal time quantum. Many algorithms developed the Round Robin algorithm. This paper provides an algorithm that improves the per...

Journal: :CoRR 2011
Rakesh Mohanty Manas Das M. Lakshmi Prasanna Sudhashree

In this paper, we have proposed a new variant of Round Robin scheduling algorithm by executing the processes according to the new calculated Fit Factor ‘f’ and using the concept of dynamic time quantum. We have compared the performance of our proposed Fittest Job First Dynamic Round Robin(FJFDRR) algorithm with the Priority Based Static Round Robin(PBSRR) algorithm. Experimental results show th...

Journal: :CoRR 2011
Himansu Sekhar Behera Rakesh Mohanty Sabyasachi Sahu Sourav Kumar Bhoi

CPU being considered a primary computer resource, its scheduling is central to operating-system design. A thorough performance evaluation of various scheduling algorithms manifests that Round Robin Algorithm is considered as optimal in time shared environment because the static time is equally shared among the processes. We have proposed an efficient technique in the process scheduling algorith...

2014
Rashmi A. Dhumal Tabassum A. Maktum

The performance of CPU is essentially depends on the scheduling algorithms. These algorithms provide a schedule for execution of processes waiting in ready queue. There are various scheduling algorithms; Round Robin is one of them. The performance of Round Robin algorithm is majorly depends on the quantum, generally which is static for all processes. There is not any standard way to decide the ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید