Sentence examples for bound for the general from inspiring English sources

Here, the result is extended by presenting an exponential lower bound for the general reachability problem.

In this section, we find sharp lower bound for the general sum-connectivity index of cacti.

In this section, we find sharp lower bound for the general Randić index of cacti.

In [20, 21], a lower and a conjectured upper bound for the general case is introduced and will be discussed later.

In particular, we first consider the cut-set outer bound for the general half-duplex two-way relay channel and then show that, for Gaussian channels, it is equivalent to the cut-set outer bound for the restricted half-duplex two-way relay channel.

The authors of [20, 21] presented a theorem to obtain a lower bound for the most general case for any given input and signature matrix symbols and additive noise with arbitrary distribution: Theorem 9 C ( m, n, ℐ, S, η ) ≥ sup π, p sup q - m E ( q ( N 1 ) ) (1) - l o g E X ̃ E b, N 1 2 - q N 1 - s b T X ̃ m m (2) (3) (30).

We derive an inner bound for the capacity region in the general discrete memoryless case and specialize to a binary noiseless case.

In [20, 21], a lower bound for the channel capacity for the general case was introduced which is stated in the following theorem: Theorem 7 C ( m, n, ℐ, S ) ≥ sup p, π - l o g E X ̃ ( ℙ ( a T X ̃ = 0 ) m ), (21).

In [10], an outer bound for the capacity of a general IFC-CR was first derived.

In [20, 21], the authors introduced a theorem that presents a conjectured upper bound for the channel capacity in general.

D is said to be a small k-dominating set if it has at most [n/k+1] nodes, which is the best lower bound for the size of D in general.