We consider the problem of multiple-input single-output broadcast channels with Rayleigh fading where the transmitter has access to delayed knowledge of the channel state information.
Motivated by combinational circuit verification and testing, we study the approximate evaluation of characteristic polynomials of Boolean functions.
Considerable insight into the large-signal operating characteristics of IMPATT oscillators has recently been obtained by D. L. Scharfetter and H. Iv.
Consider multicommodity flow problem in which the object is to maximize the sum of commodities routed. We prove the following approximate max-flow min-multicut theorem: min multicut over O(log k)
The approximate minimum average symbol error rate (SER) precoder is designed for spatial multiplexing (SM) system in Ricean channels.
Approximate query processing has recently emerged as a viable, cost-effective solution for dealing with the huge data volumes and stringent response time requirements of today's Decision Support Sy
The Capacitated Arc Routing Problem (CARP), is a capacitated variation of the arc routing problems in which there is a capacity constraint associated with each vehicle.
Consider the coupled line equations: h'{z) //(«) = = - Yoh(z) +jc(z)I0(z) + jc{z)h{z), AAO). (1) These equations are of interest in many applications.
This paper presents an approximation method for obtaining the probability the server is busy and the mean waiting time as seen by the nth arriving customer for the GI/G/1 queueing system.
An approximate but explicit likelihood ratio is derived for detecting deterministic signals in Gaussian and compound Poisson noise.
