We use computational experiments to find the rectangles of minimum perimeter into which a given number, n, of non-overlapping congruent circles can be packed.
We consider the minimum value of the permanent over certain faces of OMEGA sub n, the polytope of n x n doubly stochastic matrices.
The purpose of this study is to evaluate the minimum optical power required to achieve carrier recovery with a rms phase error of 10 degrees.
We present a novel blind synchronization method for carrier frequency offset estimation of orthogonal frequency division modulation (OFDM) systems.
We propose a new formulation of minimum verification error training and apply it to the problem of topic verification as an example.
Given a network, a set of demands and a cost function f (·), the min-cost network design problem is to route all demands with the objective of minimizing e f ( e ), where e is the total traffic loa
Given a network, a set of demands and a cost function f(.), the min-cost network design problem is to route all demands with the objective of minimizing Σe f(â"e), where â"e is the total traffic
In this paper we show that the minimum cost spanning tree is a special case of the closed semiring path-finding problem.
The need of integrating per-flow dual-leaky-bucket regulators with a scheduler that enforces strict bandwidth guarantees is becoming a crucial issue in networks that provide differentiated services
One of the classical problems of sequential circuit theory is that of obtaining a minimum-state sequential circuit satisfying the requirements of a given flow table.
