检索结果-内蒙古大学图书馆

Energy-Saving Offloading by Jointly Allocating Radio and Computational Resources for Mobile Edge Computing

IEEE ACCESS 2017年 5卷 11255-11268页

作者： Zhao, Pengtao Tian, Hui Qin, Cheng Nie, Gaofeng Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

Mobile edge computing (MEC) providing information technology and cloud-computing capabilities within the radio access network is an emerging technique in fifth-generation networks. MEC can extend the computational capacity of smart mobile devices (SMDs) and economize SMDs' energy consumption by migrating the computation-intensive task to the MEC server. In this paper, we consider a multi-mobile-users MEC system, where multiple SMDs ask for computation offloading to a MEC server. In order to minimize the energy consumption on SMDs, we jointly optimize the offloading selection, radio resource allocation, and computational resource allocation coordinately. We formulate the energy consumption minimization problem as a mixed interger nonlinear programming (MINLP) problem, which is subject to specific application latency constraints. In order to solve the problem, we propose a reformulation linearization-technique-based branch-and-bound (RLTBB) method, which can obtain the optimal result or a suboptimal result by setting the solving accuracy. Considering the complexity of RTLBB cannot be guaranteed, we further design a Gini coefficient-based greedy heuristic (GCGH) to solve the MINLP problem in polynomial complexity by degrading the MINLP problem into the convex problem. Many simulation results demonstrate the energy saving enhancements of RLTBB and GCGH.

关键词： Mobile edge computing computation offloading energy minimization branch-and-bound method reformulation-linearization-technique Gini coefficient

来源：评论

学校读者我要写书评

暂无评论

A PARALLEL IMPLEMENTATION OF THE COLUMN SUBTRACTION ALGORITHM

引用

PARALLEL COMPUTING 1995年第1期21卷 63-74页

作者： SMITH, THC THOMPSON, GL CARNEGIE MELLON UNIV GRAD SCH IND ADMPITTSBURGHPA 15213

We have implemented Harche and Thompson's column subtraction algorithm for the set partitioning problem on a CM-200 Connection Machine. The implementation involved partitioning the large array of processors in the CM-2 into segments and letting each segment explore a different part of the search tree generated by the column subtraction algorithm. Our reported computational results indicate that the segments are highly utilized and that good speedups are obtained as the number of segments is increased.

关键词： PARALLEL PROCESSING branch-and-bound method COLUMN SUBTRACTION SET PARTITIONING

来源：评论

学校读者我要写书评

暂无评论

A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems

引用

APPLIED MATHEMATICS AND COMPUTATION 2005年第2期168卷 1409-1418页

作者： Gao, YL Xue, HG Shen, PP NW Secondly Natl Coll Dept Informat & Computat Sci Yin Chuan 750021 Peoples R China Ningxia Univ Sch Math & Comp Sci Yin Chuan 750021 Peoples R China Xian Sci & Technol Univ Dept Math Xian 710048 Peoples R China Henan Normal Univ Sch Math & Informat Sci Xinxiang 453007 Henan Peoples R China

The paper presents a new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems, in which a new lower approximate linear functions of the quadratic function over an n-rectangle is given to determine a lower bound of the global optimal value of the original problem over each rectangle, and a simple two-partition technique on rectangle is used, as well as the tactics on reducing and deleting subrectangles is used to accelerate the convergence of the proposed algorithm. The proposed algorithm is proved to be convergent and shown to be effective with numerical results. (c) 2004 Elsevier Inc. All rights reserved.

关键词： nonconvex quadratic programming global optimization branch-and-bound method rectangle reducing tactics

来源：评论

学校读者我要写书评

暂无评论

A new two-level linear relaxed bound method for geometric programming problems

引用

APPLIED MATHEMATICS AND COMPUTATION 2005年第1期164卷 117-131页

作者： Gao, YL Xu, CX Wang, YJ Zhang, LS Shanghai Univ Dept Math Shanghai 200436 Peoples R China NW Secondly Natl Coll Dept Informat & Comp Sci Yinchuan 750021 Peoples R China Xi An Jiao Tong Univ Sch Sci Xian 710049 Peoples R China

In this paper a new two-level linear relaxed bound method is proposed for solving the global solution of geometric programming problems, and its convergent properties is proved, and a numerical example is used to illustrate the effectiveness of the presented algorithm. The bound technique in this algorithm is different from the other ones. The two-level relaxed linear programming problems of geometric programming problems are given without additional new variables and constraints by making use of the linear approximation of power functions and the new formulas for product to be unequal with sum. (c) 2004 Elsevier Inc. All rights reserved.

关键词： geometric programs global optimization linearization technique branch-and-bound method relaxed approximation

来源：评论

学校读者我要写书评

暂无评论

Topological optimization with a network reliability constraint

引用

DISCRETE APPLIED MATHEMATICS 2001年第1-3期115卷 135-149页

作者： Koide, T Shinmori, S Ishii, H Univ Mkt & Distribut Sci Fac Serv Ind Dept Hosp & Welf Serv Kobe Hyogo 6512103 Japan Kagoshima Univ Fac Sci Dept Math & Comp Sci Kagoshima 8900065 Japan Osaka Univ Fac Engn Dept Appl Phys Suita Osaka 5650871 Japan

This paper considers a network topological optimization problem with a reliability constraint. Jan et al. have proposed an algorithm to End the optimal selection of edges in networks, with minimum cost, under all-terminal reliability is not less than a given level. We extend their algorithm in order to apply to network design problems where operative probabilities of edges are different. Moreover, we accomplish several improvements to speed up the algorithm and show the effectiveness of our algorithm by numerical experiments. (C) 2001 Published by Elsevier Science B.V.

关键词： network design optimization network reliability branch-and-bound method upper bound

来源：评论

学校读者我要写书评

暂无评论

Optimization of fuzzy relation equations with max-product composition

引用

FUZZY SETS AND SYSTEMS 2001年第3期118卷 509-517页

作者： Loetamonphong, J Fang, SC N Carolina State Univ Dept Ind Engn Raleigh NC 27695 USA N Carolina State Univ Grad Program Operat Res Raleigh NC 27695 USA

An optimization problem with a linear objective function subject to a system of fuzzy relation equations using max-product composition is considered. Since the feasible domain is non-convex, traditional linear programming methods cannot be applied. We study this problem and capture some special characteristics of its feasible domain and the optimal solutions. Some procedures for reducing the original problem are presented. The problem is transformed into a 0-1 integer program which is then solved by the branch-and-bound method. For illustration purpose, an example of the procedures is provided. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： fuzzy relation equations max-product composition branch-and-bound method integer programming

来源：评论

学校读者我要写书评

暂无评论

Solving fuzzy relation equations with a linear objective function

引用

FUZZY SETS AND SYSTEMS 1999年第1期103卷 107-113页

作者： Fang, SC Li, GZ N Carolina State Univ Raleigh NC 27695 USA

An optimization model with a linear objective function subject to a system of fuzzy relation equations is presented. Due to the non-convexity of its feasible domain defined by fuzzy relation equations, designing an efficient solution procedure for solving such problems is not a trivial job. In this paper, we first characterize the feasible domain and then convert the problem to an equivalent problem involving 0-1 integer programming with a branch-and-bound solution technique. After presenting our solution procedure, a concrete example is included for illustration purpose. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： fuzzy relation equations branch-and-bound method integer programming

来源：评论

学校读者我要写书评

暂无评论

Optimization of Enterprise Production Programs Taking Into Account Uncertainty

引用

JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL 2024年第4期63卷 663-678页

作者： Borisov, I. A. Kosorukov, O. A. Mishchenko, A. V. Tsurkov, V. I. Financial Univ Govt Russian Federat Moscow 125167 Russia Plekhanov Russian Econ Univ Moscow State Univ Russian Presidential Acad Natl Econ & Publ Adm Moscow 119991 Russia Russian Acad Sci Fed Res Ctr Comp Sci & Control Moscow 119333 Russia

The branch-and-bound method used to select the optimal production program is considered, based on the calculation of the upper, lower, and current upper estimates when analyzing various variants for production programs. An upper bound for the number of feasible solutions to the problem under consideration is given. Models for choosing the optimal production program in conditions of production expansion are considered, as well as issues of analyzing the stability of these programs when changing the initial data of the model and when changing the criterion for the optimality of the model. The use of models for selecting the optimal production program within the framework of project management at enterprises will ensure increased efficiency of activities, including at the stages of planning and implementation of projects, as well as classification and selection of a method for implementing projects.

关键词： production program branch-and-bound method production expansion stability analysis

来源：评论

学校读者我要写书评

暂无评论

OPTIMIZATION OF COMPUTATION TIME FOR SYSTOLIC ARRAYS

引用

IEEE TRANSACTIONS ON COMPUTERS 1992年第2期41卷 159-177页

作者： WONG, YW DELOSME, JM YALE UNIV DEPT ELECT ENGNNEW HAVENCT 06520

The time performance of a systolic array implementation of an algorithm is measured by the product of two quantities: the number of systolic cycles required to complete the computations, n(sys), and the cycle time, t(sys). Yet earlier works on systolic array synthesis have exclusively sought schedules that minimize n(sys), an approach justified only when the processors have a single functional unit. This paper deals with the general case of processors with multiple, possibly pipelined, functional units that operate concurrently and presents a method for the minimization of the actual computation time n(sys) x t(sys). The selection of a linear scheduling function which minimizes n(sys) x t(sys) is formulated as a combinatorial optimization problem, which is shown to have a bounded search space. An efficient branch-and-bound method for the solution of that problem is proposed and applied to several examples.

关键词： branch-and-bound method COMBINATORIAL OPTIMIZATION COMPUTATION TIME CYCLE TIME LINEAR SCHEDULING RETIMING SYSTOLIC ARRAY SYNTHESIS UNIFORM RECURRENCE EQUATIONS

来源：评论

学校读者我要写书评

暂无评论

An exact algorithm for cost minimization in series reliability systems with multiple component choices

引用

APPLIED MATHEMATICS AND COMPUTATION 2006年第1期181卷 732-741页

作者： Ruan, Ning Sun, Xiaoling Shanghai Univ Dept Math Shanghai 200444 Peoples R China

In this paper, we present an exact method for cost minimization problems in series reliability systems with multiple component choices. The problem can be modelled as a nonlinear integer programming problem with a nonseparable constraint function. The method is of a combined Lagrangian relaxation and linearization method. A Lagrangian bound is obtained by solving the dual of a separable subproblem. An alternative lower bound is derived by 0-1 linearization method. A special cut-and-partition scheme is proposed to reduce the duality gap, thus ensuring the convergence of the method. Computational results are reported to show the efficiency of the method. (c) 2006 Elsevier Inc. All rights reserved.

关键词： reliability system cost minimization multiple component choice Lagrangian bound branch-and-bound method

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：