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

Best, worst and average case

Known as: Average-case, Worst-case, Best-case analysis 
In computer science, best, worst, and average cases of a given algorithm express what the resource usage is at least, at most and on average… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
This paper deals with the use of emerging deep learning techniques in future wireless communication networks. It will be shown… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Review
2019
Review
2019
Background: Cross project defect prediction (CPDP) recently gained considerable attention, yet there are no systematic efforts to… Expand
  • table 1
  • table 2
  • figure 1
  • table 3
  • table 7
Review
2018
Review
2018
Abstract Indicators and their composite indices have been embraced as development tools for guiding humanity toward a sustainable… Expand
Highly Cited
2015
Highly Cited
2015
Several machine learning models, including neural networks, consistently misclassify adversarial examples---inputs formed by… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2005
Highly Cited
2005
Wireless ad hoc sensor networks have recently emerged as a premier research topic. They have great long-term economic potential… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2001
Highly Cited
2001
The Strength Pareto Evolutionary Algorithm (SPEA) (Zitzler and Thiele 1999) is a relatively recent technique for finding or… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Highly Cited
1999
Highly Cited
1999
SeDuMi is an add-on for MATLAB, which lets you solve optimization problems with linear, quadratic and semidefiniteness… Expand
Highly Cited
1997
Highly Cited
1997
In the first part of the paper we consider the problem of dynamically apportioning resources among a set of options in a worst… Expand
Highly Cited
1995
Highly Cited
1995
In the first part of the paper we consider the problem of dynamically apportioning resources among a set of options in a worst… Expand
Highly Cited
1986
Highly Cited
1986
  • R. Bryant
  • IEEE Transactions on Computers
  • 1986
  • Corpus ID: 10385726
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms… Expand
  • figure 2
  • table 2
  • figure 11