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.
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… 
2011
2011
  • A. MolinS. Hirche
  • 2011
  • Corpus ID: 9898107
The design of large-scale networked control systems urges an efficient usage of available resources, such as communication… 
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… 
2003
2003
The capacity of the MIMO channel is investigated under the assumption that the elements of the channel matrix are zero mean… 
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… 
1990
1990
The design of binary block codes that are capable of correcting up to t symmetric errors and detecting all unidirectional errors… 
Highly Cited
1987
Highly Cited
1987
Previous approaches to high-sampling-rate adaptive filter implementations have been based on word-level pipelined word-parallel…