Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,110,145 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
(opens in a new tab)
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
2013
Highly Cited
2013
Intracell Cooperation and Resource Allocation in a Heterogeneous Network With Relays
Qian Li
,
R. Hu
,
Y. Qian
,
Geng Wu
IEEE Transactions on Vehicular Technology
2013
Corpus ID: 13646604
With macro and micro base stations (BSs) of different transmission and processing capabilities jointly deployed, heterogeneous…
Expand
2013
2013
When simplicity meets optimality: Efficient transmission power control with stochastic energy harvesting
Qingsi Wang
,
M. Liu
Proceedings IEEE INFOCOM
2013
Corpus ID: 15489558
We consider the optimal transmission power control of a single wireless node with stochastic energy harvesting and an infinite…
Expand
2011
2011
Distributed detection in noisy sensor networks
S. Kar
,
R. Tandon
,
H. Poor
,
Shuguang Cui
IEEE International Symposium on Information…
2011
Corpus ID: 16555550
This paper considers distributed detection over a noisy network, in which each connected sensor pair can communicate over an…
Expand
Highly Cited
2010
Highly Cited
2010
Distributed Data Storage with Minimum Storage Regenerating Codes - Exact and Functional Repair are Asymptotically Equally Efficient
V. Cadambe
,
S. Jafar
,
H. Maleki
arXiv.org
2010
Corpus ID: 15251344
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…
Expand
2008
2008
Combined cross-layer design and HARQ for multiuser systems with outdated channel state information at transmitter (CSIT) in slow fading channels
Rui Wang
,
V. Lau
IEEE Transactions on Wireless Communications
2008
Corpus ID: 41408712
Cross-layer scheduling and hybrid ARQ (HARQ) are effective means to improve the spectral efficiency of wireless systems. However…
Expand
2008
2008
Asymptotic Analysis of Reduced-Feedback Strategies for MIMO Gaussian Broadcast Channels
Jordi Diaz
,
O. Simeone
,
Y. Bar-Ness
IEEE Transactions on Information Theory
2008
Corpus ID: 9893211
Achieving the sum-capacity of a multiple-input-multiple- output (MIMO) Gaussian broadcast channel is known to require full…
Expand
2004
2004
Distributed receding horizon control of multiagent systems
W. Dunbar
2004
Corpus ID: 109482958
Multiagent systems arise in several domains of engineering. Examples include arrays of mobile sensor networks for aggregate…
Expand
1992
1992
State-dependent routing on symmetric loss networks with trunk reservations. II: Asymptotics, optimal design
D. Mitra
,
R. Gibbens
Annals of Operations Research
1992
Corpus ID: 21732180
We investigate a distributed, state-dependent, dynamic routing strategy for circuit-switched loss networks which we have called…
Expand
Highly Cited
1992
Highly Cited
1992
Numerical nonlinear regulator design
G. Kreisselmeier
,
Thomas Birkhölzer
[] Proceedings of the 31st IEEE Conference on…
1992
Corpus ID: 63098614
The state regulation problem for nonlinear plants, P, with initial conditions in a prespecified region, G, is considered. An…
Expand
Highly Cited
1987
Highly Cited
1987
Concurrent cellular VLSI adaptive filter architectures
K. Parhi
,
D. Messerschmitt
1987
Corpus ID: 62747227
Previous approaches to high-sampling-rate adaptive filter implementations have been based on word-level pipelined word-parallel…
Expand
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)
ACCEPT & CONTINUE