Skip to main content
Displaying 5331 - 5340 of 47503

Based on the classic augmented Lagrangian multiplier method, we propose, analyze and test an algorithm for solving a class of equality-constrained non-smooth optimization problems (chiefly but not

This paper presents an efficient multiuser Multiple Input Multiple Output (MU-MIMO) detection algorithm.

Coded multicasting has been shown to be a promising approach to significantly improve the caching performance of content delivery networks with multiple caches downstream of a common multicast link

We provide an efficient computational approach to solve the mixed integer programming (MIP) model developed by Tarim and Kingsman {[}8] for solving a stochastic lot-sizing problem with service leve

This paper provides an efficient computational approach to solve the mixed integer programming (MIP) model developed by Tarim and Kingsman 2004) for calculating the parameters of an (R, S) policy i

In this paper, we propose an efficient data exchange mechanism with a dedicated detection approach for Device-to-Device (D2D) communications.

With the fast emergence of Software-Defined Networking (SDN) and Cloud SIP Fire Wall (SFW), new solution is possible to defend SIP DoS attacks in IMS core network, which is impossible in traditiona

A novel efficient and low-complexity congestion management method in a differentiated service (DiffServ) domain, so-called edge-based congestion management (ECM), to improve network resource utiliz

In this paper, we present an efficient fault-tolerant distributed location management protocol for personal communications service (PCS) networks.

1.1 Definition of the Problem This paper deals with the following combinatorial problem: given a graph G with costs on its edges, partition the nodes of G into subsets no larger than a given maximu