Results 231 to 240 of about 2,687 (264)
Some of the next articles are maybe not open access.

FDQ: the fair distributed queue MAN

[Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications, 1992
A new protocol, fair distributed queue (FDQ), suitable for very high speed metropolitan area networks (MANs), is presented. FDQ is a slotted system implemented on a unidirectional fiber bus. It has similarities to the distributed queue dual bus (DQDB) protocol.
Mete Kabatepe, Kenneth S. Vastola
openaire   +1 more source

Bounded Fairness for Probabilistic Distributed Algorithms

2011 Eleventh International Conference on Application of Concurrency to System Design, 2011
This paper investigates quantitative dependability metrics for distributed algorithms operating in the presence of sporadic or frequently occurring faults. In particular, we investigate necessary revisions of traditional fairness assumptions in order to arrive at useful metrics, without adding hidden assumptions that may obfuscate their validity.
Pepijn Crouzen   +7 more
openaire   +1 more source

PAC-Bayes and Fairness: Risk and Fairness Bounds on Distribution Dependent Fair Priors. [PDF]

open access: possible, 2019
We address the problem of algorithmic fairness: ensuring that sensitive information does not unfairly influence the outcome of a classifier. We face this issue in the PAC-Bayes framework and we present an approach which trades off and bounds the risk and the fairness of the Gibbs Classifier measured with respect to different state-of-the-art fairness ...
Oneto L., Donini M., Pontil M.
openaire   +1 more source

Fair Synthesis for Asynchronous Distributed Systems

ACM Transactions on Computational Logic, 2013
We study the synthesis problem in an asynchronous distributed setting: a finite set of processes interact locally with an uncontrollable environment and communicate with each other by sending signals -- actions controlled by a sender process and that are immediately received by the target process.
Gastin, Paul, Sznajder, Nathalie
openaire   +2 more sources

Fairness in Income Distribution

2017
In this chapter, we develop the complete mathematical formalism for π‎-class societies at equilibrium. We prove that the fairest income inequality is lognormal, attained at equilibrium, in an ideal free market society. We also prove that it is unique, stable, social optimal, and moral.
openaire   +1 more source

Fair-play obligations and distributive injustice

European Journal of Political Theory, 2018
This article investigates the relationship between distributive injustice and political obligation within the confines of the fair-play theory of political obligation. More specifically, it asks how the distribution of benefits and burdens of a cooperative scheme affects people’s fair-play obligations to that scheme.
openaire   +1 more source

Incentivizing Distributive Fairness for Crowdsourcing Workers

International Joint Conference on Autonomous Agents and Multiagent Systems, 2019
In a crowd market such as Amazon Mechanical Turk, the remuneration of Human Intelligence Tasks is determined by the requester, for which they are not given many cues to ascertain how to "fairly'' pay their workers. Furthermore, the current methods for setting a price are mostly binary -- in that, the worker either gets paid or not -- as opposed to ...
Chenxi Qiu   +2 more
openaire   +2 more sources

Hybrid models with fairness and distributed clocks

1993
Explicit clocks provide a well-known possibility to introduce time into non-real-time theories of reactive systems. This technique is applied here to an approach where distributed systems are modeled with temporal logic of actions as the formal basis, and fairness as the basic force that makes events take place.
openaire   +1 more source

Home - About - Disclaimer - Privacy