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 (opens in a new tab)

Related topics

Related topics

14 relations
Abstract machineAckermann functionAlgorithmAsymptotic computational complexity

Broader (1)

Analysis of algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Serving content with unknown demand: the high-dimensional regime
In this paper, we look at content placement in the high-dimensional regime: there are n\documentclass[12pt]{minimal} \usepackage… 
2012
2012
Controlled sensing for hypothesis testing
In this paper, the problem of multiple hypothesis testing with observation control is considered. The structure of the optimal… 
2011
2011
Constant-Weight Gray Codes for Local Rank Modulation
We consider the local rank-modulation (LRM) scheme in which a sliding window going over a sequence of real-valued variables… 
2008
2008
Combined cross-layer design and HARQ for multiuser systems with outdated channel state information at transmitter (CSIT) in slow fading channels
Cross-layer scheduling and hybrid ARQ (HARQ) are effective means to improve the spectral efficiency of wireless systems. However… 
2007
2007
Joint power control and user scheduling in multicell wireless networks: Capacity scaling laws
We address the optimization of the sum rate performance in multicell interference-limited singlehop networks where access points… 
2004
2004
Distributed receding horizon control of multiagent systems
Multiagent systems arise in several domains of engineering. Examples include arrays of mobile sensor networks for aggregate… 
2004
2004
Delay-limited throughput of ad hoc networks
The delay-limited throughput of an ad hoc wireless network confined to a finite region is investigated. An approximate expression… 
2003
2003
Source coding exponents for zero-delay coding with finite memory
Fundamental limits on the source coding exponents (or large deviations performance) of zero-delay finite-memory (ZDFM) lossy… 
Highly Cited
1992
Highly Cited
1992
Numerical nonlinear regulator design
The state regulation problem for nonlinear plants, P, with initial conditions in a prespecified region, G, is considered. An… 
1983
1983
Low Complexity Decoders for Constant Envelope Digital Modulations
Digital angle modulations having input symbol memory can be demodulated using maximum likelihood sequence estimation (MLSE or… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)