Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

SCSI check condition

In computer terminology, a Check Condition occurs when a SCSI device needs to report an error. SCSI communication takes place between an initiator… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
In this paper, an integral reinforcement learning (IRL) algorithm on an actor-critic structure is developed to learn online the… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
2012
2012
Abstract The need to organize and analyze real-valued matrices arises in various settings – notably, in data analysis (where… Expand
2012
2012
Author(s): Rudelson, Mark; Vershynin, Roman | Abstract: We show that a perturbation of any fixed square matrix D by a random… Expand
2007
2007
  • Jian-Lin Li
  • Proceedings of the Edinburgh Mathematical Society
  • 2007
  • Corpus ID: 119758845
Abstract The aim of this paper is to investigate and study the possible spectral pair $(\mu_{M,D},\varLambda(M,S))$ associated… Expand
2007
2007
This paper examines the validity of the “folk” intuition that endogenous formation of jurisdictions is likely to create… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2004
Highly Cited
2004
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate… Expand
  • figure 1
  • figure 2
  • figure 1
  • figure 4
  • figure 7
Highly Cited
2004
Highly Cited
2004
We study the problem of constructing infinite words having a prescribed finite set P of palindromes. We first establish that the… Expand
2000
2000
In this paper we give a necessary condition for structural identifiability of uncontrolled autonomous systems. This condition… Expand
1991
1991
A simpler treatment is given of the theorems of Dye and Krieger concerning the classication of non-singular ergodic… Expand
Highly Cited
1988
Highly Cited
1988
The Stone representation theorem for Boolean algebras gives us a finite set of equations axiomatizing the class of Boolean set… Expand