Results 1  10
of
3,962
Introduction to redundant arrays of inexpensive disks
 Proceedings of the IEEE COMPCON
, 1989
"... Abstract Increasmg performance of CPUs and memorres wrll be squandered lf not matched by a sunrlm peformance ourease m II0 Whde the capactty of Smgle Large Expenstve D&T (SLED) has grown rapuily, the performance rmprovement of SLED has been modest Redundant Arrays of Inexpensive Disks (RAID), ba ..."
Abstract

Cited by 846 (55 self)
 Add to MetaCart
Abstract Increasmg performance of CPUs and memorres wrll be squandered lf not matched by a sunrlm peformance ourease m II0 Whde the capactty of Smgle Large Expenstve D&T (SLED) has grown rapuily, the performance rmprovement of SLED has been modest Redundant Arrays of Inexpensive Disks (RAID
The validity and utility of selection methods in personnel psychology: Practical and theoretical implications of 85 years of research findings
 Psychological Bulletin
, 1998
"... This article summarizes the practical and theoretical implications of 85 years of research in personnel selection. On the basis of metaanalytic findings, this article presents the validity of 19 selection procedures for predicting job performance and training performance and the validity of paired ..."
Abstract

Cited by 354 (2 self)
 Add to MetaCart
structured interview (mean validity of.63). A further advantage of the latter 2 combinations is that they can be used for both entry level selection and selection of experienced employees. The practical utility implications of these summary findings are substantial. The implications of these research
Truth and the Unprovability of Consistency
"... Abstract: It might be thought that we could argue for the consistency of a mathematical theory T within T, by giving an inductive argument that all theorems of T are true and inferring consistency. By Gödel’s second incompleteness theorem any such argument must break down, but just how it breaks dow ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
down depends on the kind of theory of truth that is built into T. The paper surveys the possibilities, and suggests that some theories of truth give far more intuitive diagnoses of the breakdown than do others. The paper concludes with some morals about the nature of validity and about a possible
A Sequent Calculus for Circumscription
, 1997
"... . In this paper, we introduce a sequent calculus CIRC for propositional Circumscription. This work is part of a larger project, aiming at a uniform prooftheoretic reconstruction of the major families of nonmonotonic logics. Among the novelties of the calculus, we mention that CIRC is analytic ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. In this paper, we introduce a sequent calculus CIRC for propositional Circumscription. This work is part of a larger project, aiming at a uniform prooftheoretic reconstruction of the major families of nonmonotonic logics. Among the novelties of the calculus, we mention that CIRC is analytic
Resource Bounded Unprovability of
, 2003
"... This paper shows that the proof complexity (minimum computational complexity of proving formally or asymptotically) of "P6=NP" is superpolynomialtime with respect to a theory T , which is a consistent extension of Peano Arithmetic (PA), and PTM!consistent, where the PTM!consistenc ..."
Abstract
 Add to MetaCart
This paper shows that the proof complexity (minimum computational complexity of proving formally or asymptotically) of "P6=NP" is superpolynomialtime with respect to a theory T , which is a consistent extension of Peano Arithmetic (PA), and PTM!consistent, where the PTM
A theory of defeasible reasoning
, 1991
"... Reasoning can lead not only to the adoption of beliefs, but also to the retraction of beliefs. In philosophy, this is described by saying that reasoning is defeasible. My ultimate objective is the construction of a general theory of reasoning and its implementation in an automated reasoner capable o ..."
Abstract

Cited by 283 (7 self)
 Add to MetaCart
of both deductive and defeasible reasoning. The resulting system is named “OSCAR. ” This article addresses some of the theoretical underpinnings of OSCAR. This article extends my earlier theory in two directions. First, it addresses the question of what the criteria of adequacy should be for a defeasible
Some efficient solutions to the affine scheduling problem  Part I Onedimensional Time
, 1996
"... Programs and systems of recurrence equations may be represented as sets of actions which are to be executed subject to precedence constraints. In many cases, actions may be labelled by integral vectors in some iteration domain, and precedence constraints may be described by affine relations. A s ..."
Abstract

Cited by 271 (22 self)
 Add to MetaCart
Programs and systems of recurrence equations may be represented as sets of actions which are to be executed subject to precedence constraints. In many cases, actions may be labelled by integral vectors in some iteration domain, and precedence constraints may be described by affine relations. A
Proving unprovability in some normal modal logics
 Bulletin of the Section of Logic. Polish Academy of Science
, 1991
"... The present communication suggests deductive systems for the operator ⊣ of unprovability in some particular propositional normal modal logics. We give thus complete syntactic characterization of these logics in the sense of ̷Lukasiewicz: for every formula φ either ⊢ φ or ⊣ φ (but not both) is deriva ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The present communication suggests deductive systems for the operator ⊣ of unprovability in some particular propositional normal modal logics. We give thus complete syntactic characterization of these logics in the sense of ̷Lukasiewicz: for every formula φ either ⊢ φ or ⊣ φ (but not both
Results 1  10
of
3,962