Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,849,051 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
14 relations
Abstract machine
Ackermann function
Algorithm
Asymptotic 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
O. Dekel
,
Ran Gilad-Bachrach
,
O. Shamir
,
Lin Xiao
J. Mach. Learn. Res.
2012
Corpus ID: 3043622
Online prediction methods are typically presented as serial algorithms running on a single processor. However, in the age of web…
Expand
Highly Cited
2011
Highly Cited
2011
Sampling-based algorithms for optimal motion planning
S. Karaman
,
Emilio Frazzoli
Int. J. Robotics Res.
2011
Corpus ID: 14876957
During the last decade, sampling-based path planning algorithms, such as probabilistic roadmaps (PRM) and rapidly exploring…
Expand
Highly Cited
2010
Highly Cited
2010
Incremental Sampling-based Algorithms for Optimal Motion Planning
S. Karaman
,
Emilio Frazzoli
Robotics: Science and Systems
2010
Corpus ID: 9208217
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs…
Expand
Highly Cited
2010
Highly Cited
2010
An Asymptotically Optimal Bandit Algorithm for Bounded Support Models
J. Honda
,
A. Takemura
COLT
2010
Corpus ID: 120162138
Multiarmed bandit problem is a typical example of a dilemma between exploration and exploitation in reinforcement learning. This…
Expand
Highly Cited
2008
Highly Cited
2008
Gaussian Interference Channel Capacity to Within One Bit
R. Etkin
,
David Tse
,
Hua Wang
IEEE Transactions on Information Theory
2008
Corpus ID: 52855148
The capacity of the two-user Gaussian interference channel has been open for 30 years. The understanding on this problem has been…
Expand
Highly Cited
2007
Highly Cited
2007
Asymptotically Optimal Energy-Aware Routing for Multihop Wireless Networks With Renewable Energy Sources
Longbi Lin
,
N. Shroff
,
R. Srikant
IEEE/ACM Transactions on Networking
2007
Corpus ID: 14995991
In this paper, we develop a model to characterize the performance of multihop radio networks in the presence of energy…
Expand
Highly Cited
2005
Highly Cited
2005
On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation
A. Stolyar
Oper. Res.
2005
Corpus ID: 9390044
We consider the model whereN queues (users) are served in discrete time by a generalized switch. The switch state is random, and…
Expand
Highly Cited
2003
Highly Cited
2003
On the achievable throughput of a multiantenna Gaussian broadcast channel
G. Caire
,
S. Shamai
IEEE Transactions on Information Theory
2003
Corpus ID: 13926433
A Gaussian broadcast channel (GBC) with r single-antenna receivers and t antennas at the transmitter is considered. Both…
Expand
Highly Cited
2003
Highly Cited
2003
Cache-Oblivious Algorithms
C. Leiserson
CIAC
2003
Corpus ID: 7817151
Computers with multiple levels of caching have traditionally required techniques such as data blocking in order for algorithms to…
Expand
Highly Cited
1992
Highly Cited
1992
Optimal Tests When a Nuisance Parameter Is Present Only Under the Alternative
D. Andrews
,
W. Ploberger
1992
Corpus ID: 17215343
This paper derives asymptotically optimal tests for testing problems in which a nuisance parameter exists under the alternative…
Expand
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
ACCEPT & CONTINUE