Asymptotically optimal algorithm

Known as: Asymptotic optimality, Asymptotically faster algorithm, Asymptotically optimal 
In computer science, an algorithm is said to be asymptotically optimal if, roughly speaking, for large inputs it performs at worst a constant factor… (More)
Wikipedia

Related topics

Related topics

14 relations
Abstract machineAckermann functionAlgorithmAsymptotic computational complexity
(More)

Broader (1)

Analysis of algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Slicing Triangle Meshes: An Asymptotically Optimal Algorithm
Additive Manufacturing, popularly known as "3D printing", is a manufacturing process based on overlapping of flat layers in order… (More)
  • figure 1
  • figure 2
  • table I
  • figure 4
Is this relevant?
2012
2012
Asymptotically optimal algorithm for stochastic adwords
In this paper we consider the adwords problem in the unknown distribution model. We consider the case where the budget to bid… (More)
  • table I
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Sampling-based algorithms for optimal motion planning
During the last decade, sampling-based path planning algorithms, such as Probabilistic RoadMaps (PRM) and Rapidly-exploring… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation
We consider the model where N queues (users) are served in discrete time by a generalized switch. The switch state is random, and… (More)
  • figure 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Asymptotically optimal geometric mobile ad-hoc routing
In this paper we present AFR, a new geometric mobile ad-hoc routing algorithm. The algorithm is completely distributed; nodes… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Asymptotically optimal water-filling in vector multiple-access channels
Dynamic resource allocation is an important means to increase thesum capacityof fading multiple-access channels (MACs). In this… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
We propose asymptotically optimal algorithms for the job shop scheduling and packet routing problems. We propose a fluid… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1997
Highly Cited
1997
WEAK CONVERGENCE AND OPTIMAL SCALING OF RANDOM WALK METROPOLIS ALGORITHMS
This paper considers the problem of scaling the proposal distribution of a multidimensional random walk Metropolis algorithm in… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
An asymptotically optimal multiversion B-tree
In a variety of applications, we need to keep track of the development of a data set over time. For maintaining and querying… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1979
Highly Cited
1979
Asymptotically optimal block quantization
for the mean-square quantizing error where N is the. number of level&p(x) is the probability density of the input, and E’(x) is… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 3
  • table I
Is this relevant?