Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia

Related topics

Related topics

14 relations
Abstract machineAckermann functionAlgorithmAsymptotic computational complexity
Expand

Broader (1)

Analysis of algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Optimal Distributed Online Prediction Using Mini-Batches
Online prediction methods are typically presented as serial algorithms running on a single processor. However, in the age of web… 
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… 
Highly Cited
2010
Highly Cited
2010
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs… 
Highly Cited
2010
Highly Cited
2010
An Asymptotically Optimal Bandit Algorithm for Bounded Support Models
Multiarmed bandit problem is a typical example of a dilemma between exploration and exploitation in reinforcement learning. This… 
Highly Cited
2008
Highly Cited
2008
Gaussian Interference Channel Capacity to Within One Bit
The capacity of the two-user Gaussian interference channel has been open for 30 years. The understanding on this problem has been… 
Highly Cited
2007
Highly Cited
2007
Asymptotically Optimal Energy-Aware Routing for Multihop Wireless Networks With Renewable Energy Sources
In this paper, we develop a model to characterize the performance of multihop radio networks in the presence of energy… 
Highly Cited
2005
Highly Cited
2005
On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation
We consider the model whereN queues (users) are served in discrete time by a generalized switch. The switch state is random, and… 
Highly Cited
2003
Highly Cited
2003
On the achievable throughput of a multiantenna Gaussian broadcast channel
A Gaussian broadcast channel (GBC) with r single-antenna receivers and t antennas at the transmitter is considered. Both… 
Highly Cited
2003
Highly Cited
2003
Cache-Oblivious Algorithms
Computers with multiple levels of caching have traditionally required techniques such as data blocking in order for algorithms to… 
Highly Cited
1992
Highly Cited
1992
Optimal Tests When a Nuisance Parameter Is Present Only Under the Alternative
This paper derives asymptotically optimal tests for testing problems in which a nuisance parameter exists under the alternative… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License