Bottleneck

In engineering, a bottleneck is a phenomenon by which the performance or capacity of an entire system is severely limited by a single component. The… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1979-2017
010203019792017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Bottleneck features have been shown to be effective in improving the accuracy of automatic speech recognition (ASR) systems… (More)
  • table 2
  • figure 1
  • figure 2
  • table 3
  • table 4
Is this relevant?
2011
2011
We consider routing games on grid network topologies. The social cost is the worst congestion in any of the network edges… (More)
  • figure 1
  • figure 2
Is this relevant?
2010
2010
Phenomenon of bottleneck shiftiness was studied in this paper, including bottleneck shiftiness causes, its representation and… (More)
  • table III
  • table I
  • table V
  • table VII
  • figure 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure A.1
Is this relevant?
2005
2005
The loss and delay experienced by packets traveling along an Internet network path are mainly governed by the characteristics of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Accurate measurement of network bandwidth is crucial for exible Internet applications and protocols which actively manage and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
The performance of a manufacturing or logistic system is determined by its constraints. Therefore, in order to improve the… (More)
  • table 2
  • figure 1
  • table 3
  • table 1
  • figure 2
Is this relevant?
2002
2002
This paper provides a novel method for detecting bottlenecks in manufacturing systems and the shifting of these bottlenecks. All… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
1996
1996
The bottleneck graph partition problem is to partition the nodes of a graph into two equally sized sets, so that the maximum edge… (More)
Is this relevant?
1993
1993
An II x m matrix A is called bottleneck Monge matrix if max{ajj, a,,} < max{a,, ali} for all l<i<r<n, 1 < j < s < m. The matrix A… (More)
Is this relevant?