Results 1  10
of
127
The Reliability Of Reasoning With Unreliable Arguments
, 1991
"... In this paper, the well known mathematical theory of evidence (Shafer, 1976) will be considered from a point of view which is different from usual. Simple belief functions (hints) will be regarded as arguments which are not fully reliable (Kohlas, 1989). This implies that the construction of argumen ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
In this paper, the well known mathematical theory of evidence (Shafer, 1976) will be considered from a point of view which is different from usual. Simple belief functions (hints) will be regarded as arguments which are not fully reliable (Kohlas, 1989). This implies that the construction
1 THE RELIABILITY OF REASONING WITH UNRELIABLE ARGUMENTS
"... In this paper, the well known mathematical theory of evidence (Shafer, 1976) will be considered from a point of view which is di erent from usual. Simple belief functions (hints) will be regarded as arguments which are not fully reliable (Kohlas, 1989). This implies that the construction of argument ..."
Abstract
 Add to MetaCart
with unreliable arguments into the framework of combinatorial reliability theory as developed for the study of technical systems composed of unreliable components (see also Provan, 1990). Most approaches proposed so far for the combination of evidence could be quali ed as \forward chaining " methods
Network Coding for Distributed Storage Systems
, 2008
"... Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peertopeer storage systems, and storage in wireless networks. Storing data using an erasure code, in fragments spread across nodes, ..."
Abstract

Cited by 338 (13 self)
 Add to MetaCart
Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peertopeer storage systems, and storage in wireless networks. Storing data using an erasure code, in fragments spread across nodes
Unreliable Knowledge *
"... ABSTRACT — There is a virtual consensus in contemporary epistemology that knowledge must be reliably produced. Everyone, it seems, is a reliabilist about knowledge in that sense. I present and defend two arguments that unreliable knowledge is possible. My first argument proceeds from an observation ..."
Abstract
 Add to MetaCart
ABSTRACT — There is a virtual consensus in contemporary epistemology that knowledge must be reliably produced. Everyone, it seems, is a reliabilist about knowledge in that sense. I present and defend two arguments that unreliable knowledge is possible. My first argument proceeds from an observation
Optimality Of ZeroInventory Policies For Unreliable Manufacturing Systems
 Operations Research
, 1999
"... We show that there are ranges of parameter values describing an unreliable manufacturing system for which zeroinventory policies are exactly optimal even when there is uncertainty in manufacturing capacity. This result may be initially surprising since it runs counter to the argument that inventori ..."
Abstract

Cited by 67 (6 self)
 Add to MetaCart
We show that there are ranges of parameter values describing an unreliable manufacturing system for which zeroinventory policies are exactly optimal even when there is uncertainty in manufacturing capacity. This result may be initially surprising since it runs counter to the argument
UNRELIABLE ENGINEERING SYSTEMS AND KOLMOGOROV COMPLEXITY
, 2002
"... As a main result we estimate the lower bound for the number of faulty/correct components in the unreliable complex systems with random faults in the form Ω (f(n) / log f(n)), where f(n) is the total number of unreliable components. In order to prove this result, the Kolmogorov complexity argument is ..."
Abstract
 Add to MetaCart
As a main result we estimate the lower bound for the number of faulty/correct components in the unreliable complex systems with random faults in the form Ω (f(n) / log f(n)), where f(n) is the total number of unreliable components. In order to prove this result, the Kolmogorov complexity argument
Epistemically Selfdefeating Arguments and Skepticism about Intuition
, 2012
"... An argument is epistemically selfdefeating when either the truth of an argument’s conclusion or belief in an argument’s conclusion defeats one’s justification to believe at least one of that argument’s premises. Some extant defenses of the evidentiary value of intuition have invoked considerations ..."
Abstract
 Add to MetaCart
voked considerations of epistemic selfdefeat in their defense. I argue that there is one kind of argument against intuition, an unreliability argument, which, even if epistemically selfdefeating, can still imply that we are not justified in thinking intuition has evidentiary value. 1 Intuition and Epistemic Self
Toward Maximizing the Quality of Results of Dependent Tasks Computed Unreliably
, 2004
"... This paper studies the problem of maximizing the number of correct results of dependent tasks computed unreliably. We consider a distributed system composed of a reliable server that coordinates the computation of a massive number of unreliable workers. Any worker computes correctly with probability ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
This paper studies the problem of maximizing the number of correct results of dependent tasks computed unreliably. We consider a distributed system composed of a reliable server that coordinates the computation of a massive number of unreliable workers. Any worker computes correctly
Improved Efficient Arguments
"... Abstract. We consider complexity of perfect zeroknowledge arguments [6]. Let T denote the time needed to (deterministically) check a proof and let L denote an appropriate security parameter. We introduce new techniques for implementing very efficient zeroknowledge arguments. The resulting argument ..."
Abstract
 Add to MetaCart
Abstract. We consider complexity of perfect zeroknowledge arguments [6]. Let T denote the time needed to (deterministically) check a proof and let L denote an appropriate security parameter. We introduce new techniques for implementing very efficient zeroknowledge arguments. The resulting
Moral Intuitionism, Experiments and Skeptical Arguments 1
"... Over the last decade there have been various attempts to use empirical data about people’s dispositions to choose to undermine various moral positions by arguing that our judgements about what to do are unreliable. Usually they are directed at nonconsequentialists by consequentialists, but they hav ..."
Abstract
 Add to MetaCart
Over the last decade there have been various attempts to use empirical data about people’s dispositions to choose to undermine various moral positions by arguing that our judgements about what to do are unreliable. Usually they are directed at nonconsequentialists by consequentialists
Results 1  10
of
127