Patrick A. Hosein

Learn More
We consider the standard single commodity network flow problem with both linear and strictly convex possibly nondifferentiable arc costs. For the case where all arc costs are strictly convex we study the convergence of a dual Gauss-Seide! type relaxation method that is well suited for parallel computation. We then extend this method to the case where some(More)
19. ABSTRACT (Continue on reverse if *sesary and identify by block number) In this paper we present progfess report on ourwork on the dynamic version of the Weapon to Tar et Assignment (WTA) problemox the static version of the WTA problem in which vulner"a-5 _nodes are included in the formulation. In the static WTA problem, weapons must be assigned to(More)
In traditional CDMA wireless networks, real-time services, such as circuit-switched voice, are transported over the air via synchronous channels because of their stringent delay requirements. In the third generation networks (3G), IxEV-DV [A.Soong et al., 2003] and HSDPA [E. Dahlman et al., 1998], an additional time shared channel was introduced on the(More)
We consider a multi-stage version of the Weapon-Target Allocation problem. This problem models the following battle scenario. The offense launches a number of weapons (the targets) which are aimed at assets of the defense. These targets are assigned values by the defense. The defense has a number of (non-reusable) defensive weapons each of which can engage(More)
We consider the information-theoretic sum capacity of the reverse link of a CDMA wireless network. In particular we consider the problem of maximizing the throughput of this channel. The decision variables are the transmission powers that are allocated to the mobiles in the network. The major contribution of this paper is the derivation of thresholds that(More)