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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

Lower and upper bounds on the maximum priority inversion blocking (pi-blocking) that is generally unavoidable in distributed…

2012

In this paper, the problem of multiple hypothesis testing with observation control is considered. The structure of the optimal…

2005

In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless…

2004

The delay-limited throughput of an ad hoc wireless network confined to a finite region is investigated. An approximate expression…

2003

The capacity of the MIMO channel is investigated under the assumption that the elements of the channel matrix are zero mean…

2003

Fundamental limits on the source coding exponents (or large deviations performance) of zero-delay finite-memory (ZDFM) lossy…

2002

Consider a queueing system with many queues, each with its own input stream, but with only one server. The server must allocate…

2002

We consider a Gaussian additive-noise channel with interference known to the transmitter but unknown to the receiver. A precoding…

1985

The capabilities of classical, minimum energy, and linear predictive array processing algorithms to estimate the bearings of two…

1983

Digital angle modulations having input symbol memory can be demodulated using maximum likelihood sequence estimation (MLSE or…