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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
With macro and micro base stations (BSs) of different transmission and processing capabilities jointly deployed, heterogeneous… 
2013
2013
We consider the optimal transmission power control of a single wireless node with stochastic energy harvesting and an infinite… 
2011
2011
This paper considers distributed detection over a noisy network, in which each connected sensor pair can communicate over an… 
Highly Cited
2010
Highly Cited
2010
We consider a set up where a file of size M is stored in n distributed storage nodes, using an (n,k) minimum storage regenerating… 
2008
2008
Cross-layer scheduling and hybrid ARQ (HARQ) are effective means to improve the spectral efficiency of wireless systems. However… 
2008
2008
Achieving the sum-capacity of a multiple-input-multiple- output (MIMO) Gaussian broadcast channel is known to require full… 
2004
2004
Multiagent systems arise in several domains of engineering. Examples include arrays of mobile sensor networks for aggregate… 
1992
1992
We investigate a distributed, state-dependent, dynamic routing strategy for circuit-switched loss networks which we have called… 
Highly Cited
1992
Highly Cited
1992
The state regulation problem for nonlinear plants, P, with initial conditions in a prespecified region, G, is considered. An… 
Highly Cited
1987
Highly Cited
1987
Previous approaches to high-sampling-rate adaptive filter implementations have been based on word-level pipelined word-parallel…