Shortest seek first

Known as: SSF, SSTF, Shortest seek time first 
Shortest seek first (or shortest seek time first) is a secondary storage scheduling algorithm to determine the motion of the disk's arm and head in… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Evidence is mounting that ConvNets are the best representation learning method for recognition. In the common scenario, a ConvNet… (More)
  • figure 2
  • figure 1
  • table 1
  • table 2
  • figure 3
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Deformable part-based models [1, 2] achieve state-of-the-art performance for object detection, but rely on heuristic… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
This paper is concerned with the parameter estimation of a relatively general class of nonlinear dynamic systems. A Maximum… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Coherent optical transmission systems have a four-dimensional (4-D) signal space (two quadratures in two polarizations). These… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 6
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We present at first some generaJ considerations about specificity and characteristics of SSF, their advantages and disadvantages… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The development of efficient vehicle-to-vehicle (V2V) communications systems requires an understanding of the underlying… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Solid-state fermentation has emerged as a potential technology for the production of microbial products such as feed, fuel, food… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Effective engineering of the Internet is predicated upon a detailed understanding of issues such as the large-scale structure of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Effective engineering of the Internet is predicated upon a detailed understanding of issues such as the large-scale structure of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Any belief function can be decomposed into a confidence and a diffidence components. Each components is uniquely decomposable… (More)
Is this relevant?