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

3rd International Symposium on Parallel Architectures, algorithms, and Networks (I-Span 97)

作者： Horita, T Takanami, I Iwate Univ Fac Engn Dept Comp & Informat Sci Morioka Iwate 020 Japan

ISBN: (纸本)0818682596

As VLSI technology has developed, the interest in implementing an entire or significant part of a parallel computer system using wafer scale integration is growing. The major problem for the case is the possibility of drastically low yield and/or reliability of the system if there is no strategy for coping with such situations. Various strategies to restructure the faulty physical system into the fault-free target logical system are described in the literature. These restructures are performed using interconnection networks consisting of links and switches. Then the reliabilities of the systems depend on those of PEs and the interconnection networks. However, as far as we know, there are few studies considering the simultaneous faults of PEs and interconnection links. In this paper, by extending the Roychowdhury's algorithm, we propose a polynomial time algorithm for reconfiguring the 1 1/2 track-switch model compensating for simultaneous PEs and buses faults.

关键词： mesh arrays fault-tolerance polynomial time algorithm wafer scale integration the 1 1/2 track-switch model

来源：评论

学校读者我要写书评

暂无评论

Optimal stationary control of discrete processes and a polynomial time algorithm for stochastic control problem on networks

Optimal stationary control of discrete processes and a polyn...

引用

International Conference on Computational Science (ICCS)

作者： Lozovanu, Dmitrii Pickl, Stefan Acad Sci Inst Math & Comp Sci Acad Str 5 MD-2028 Kishinev Moldova Univ Bundeswehr Munchen Fak Informat Inst Theoret Informat Math & Operat Res Munich Germany

The stochastic version of classical discrete optimal control problems with a finite set of states and infinite time horizon is studied. An approach for determining the optimal stationary control in discrete processes with deterministic and random states' transitions of the dynamical system is described. The main problem is formulated on networks and a polynomial time algorithm for its solving is proposed. An application of the proposed algorithm for a class of stochastic decision problems is described. (C) 2010 Published by Elsevier Ltd.

关键词： discrete processes stationary strategies optimal stationary control stochastic control problem on networks polynomial time algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal stationary control of discrete processes and a polynomial time algorithm for stochastic control problem on networks

引用

Procedia Computer Science 2010年第1期1卷 1417-1426页

作者： Dmitrii Lozovanu Stefan Pickl Institute of Mathematics and Computer Science Academy of Sciences Academy str. 5 Chisinau MD-2028 Moldova Institut für Theoretische Informatik Mathematik und Operations Research Fakultät fur Informatik Universität der Bundeswehr München

The stochastic version of classical discrete optimal control problems with a finite set of states and infinite time horizon is studied. An approach for determining the optimal stationary control in discrete processes with deterministic and random states’ transitions of the dynamical system is described. The main problem is formulated on networks and a polynomial time algorithm for its solving is proposed. An application of the proposed algorithm for a class of stochastic decision problems is described.

关键词： Discrete processes Stationary strategies Optimal stationary control Stochastic control problem on networks polynomial time algorithm

来源：评论

学校读者我要写书评

暂无评论

A polynomial-time algorithm for Pliable Index Coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2018年第2期64卷 979-999页

作者： Song, Linqi Fragouli, Christina Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90095 USA

In pliable index coding, we consider a server with m messages and n clients, where each client has as side information a subset of the messages. We seek to minimize the number of broadcast transmissions, so that each client can recover any one unknown message she does not already have. Previous work has shown that the pliable index coding problem is NP-hard and requires at most O(log(2)(n)) broadcast transmissions, which indicates exponential savings over the conventional index coding that requires in the worst case O(n) transmissions. In this paper, building on a decoding criterion that we propose, we first design a deterministic polynomial-time algorithm that can realize the exponential benefits, by achieving, in the worst case, a performance upper bounded by O(log(2)(n)) broadcast transmissions. We extend our algorithm to the t-requests case, where each client requires t unknown messages that she does not have, and show that our algorithm requires at most O(t log(n) + log(2)(n)) broadcast transmissions. We construct lower bound instances that require at least Omega(log(n)) transmissions for linear pliable index coding and at least Omega(t + log(n)) transmissions for the t-requests case, indicating that both our upper and lower bounds are polynomials of log(n) and differ within a factor of O(log(n)). We provide a probabilistic analysis over random instances and show that the required number of transmissions is almost surely Theta(log(n)), as compared with the Theta(n/log(n)) for index coding. In addition, we show that these upper and lower bounds also hold for vector pliable index coding in the worst case instances and the random graph instances, implying that vector coding does not provide benefits in terms of these bounds. Our numerical experiments show that our algorithm outperforms existing algorithms for pliable index coding by up to 50% less transmissions.

关键词： Pliable index coding index coding t-requests polynomial time algorithm greedy algorithm random graphs

来源：评论

学校读者我要写书评

暂无评论

A polynomial time algorithm for Undirected Graph Isomorphism

A Polynomial Time Algorithm for Undirected Graph Isomorphism

引用

2011 World Congress on Engineering and Technology(CET 2011)

作者： Aimin Hou Zhifeng Hao School of Computer Science and Engineering South China University of Technology Guangzhou,China

Graph isomorphism is an important problem in graph theory.A popular class of testing methods uses necessary conditions to refine the vertex partition iteratively with ***,these known algorithms need many more backtracking operations so as to construct a search tree for testing and pruning which results in exponential time cost in the worst *** partition property of a necessary condition plays the key role in determining the efficiency of this kind *** on a more effective necessary condition we proposed previously,this paper develops an O(n 4) algorithm for undirected graph isomorphism using vertex partition and *** algorithm takes advantage of the intersecting operation on the vertex match set and the recursive property of the graph isomorphism resulting in the subgraph *** experiments on the Graph Database validated the correctness and the efficiency of this algorithm for graph isomorphism.

关键词： necessary condition intersecting operation graph isomorphism subgraph isomorphism polynomial time algorithm

来源：评论

学校读者我要写书评

暂无评论

Distribution path optimization of automated warehouse based on polynomial time algorithm

Distribution path optimization of automated warehouse based ...

引用

2017 6th International Conference on Advanced Materials and Computer Science(ICAMCS 2017)

作者： Lvqing Yang Wei-wei LIU Youjing Bai Software School Xiamen University Faculty of Informatics Fujian Vocational College of Agriculture

This paper discusses the use of polynomial time algorithm for solving the distribution path optimization of unit load automatic distribution system which was used in storage systems commonly,under the condition of specified goods consolidation and rectilinear norm movement mode,establishes the mathematical models according to the characteristics,uses the main circuit which is formed by the algorithm's directed graph as the optimal solution of the model problem,the time complexity of the algorithm is O(n),so it has great practical value.

关键词： Order picking Path optimization polynomial time algorithm Rectilinear norm movement mode

来源：评论

学校读者我要写书评

暂无评论

A polynomial-time algorithm for finding ε in DEA models

引用

COMPUTERS & OPERATIONS RESEARCH 2004年第5期31卷 803-805页

作者： Amin, GR Toloo, M Islamic Azad Univ Sci & Res Branch Dept Math Tehran Iran

This paper presents a new algorithm for computing the non-Archimedean epsilon in DEA models. It is shown that this algorithm is polynomial-time of 0(n), where n is the number of decision making units (DMUs). Also it is proved that using only inputs and outputs of DMUs, the non-Archimedean epsilon can be found such that, the optimal values of all CCR models, which are corresponding to all DMUs, are bounded and an assurance value is obtained. (C) 2003 Elsevier Ltd. All rights reserved.

关键词： data envelopment analysis non-Archimedean epsilon polynomial time algorithm

来源：评论

学校读者我要写书评

暂无评论

A polynomial time Exact algorithm for Overlay-Resistant Self-Aligned Double Patterning (SADP) Layout Decomposition

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2013年第8期32卷 1228-1239页

作者： Xiao, Zigang Du, Yuelin Zhang, Hongbo Wong, Martin D. F. Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA Synopsys Inc Hillsboro OR 97124 USA

Double patterning lithography (DPL) technologies have become a must for today's sub-32 nm technology nodes. Currently, there are two leading DPL technologies: self-aligned double patterning (SADP) and litho-etch-litho-etch (LELE). Among them, SADP has the significant advantage over LELE in its ability to avoid overlay, making it the likely DPL candidate for the next technology node of 14 nm. In any DPL technology, layout decomposition is the key problem. While the layout decomposition problem for LELE has been well studied in the literature, only a few attempts have been made to address the SADP layout decomposition problem. In this paper, we present a polynomial time exact (optimal) algorithm to determine if a given layout has SADP decompositions that do not have any overlay at specified critical edges. The previous approaches tried to minimize the total overlay of a given layout, which may be a problematic objective. Furthermore, all previous exact algorithms were computationally expensive exponential time algorithms based on SAT or ILP. Other previous algorithms for the problem were heuristics without having any guarantee that an overlay-free solution can be found even if one exists.

关键词： Computer-aided design design for manufacturability electronic design automation layout decomposition polynomial time algorithm self-aligned double patterning

来源：评论

学校读者我要写书评

暂无评论

A polynomial time dual algorithm for the Euclidean multifacility location problem

引用

OPERATIONS RESEARCH LETTERS 1996年第4期18卷 201-204页

作者： Xue, GL Rosen, JB Pardalos, PM UNIV MINNESOTA DEPT COMP SCI MINNEAPOLIS MN 55455 USA UNIV FLORIDA DEPT IND & SYST ENGN GAINESVILLE FL 32611 USA

The Euclidean multi-facility location (EMFL) problem is one of locating new facilities in the Euclidean space with respect to existing facilities. The problem consists of finding locations of new facilities which will minimize a total cost function which consists of a sum of costs directly proportional to the Euclidean distances between the new facilities, and costs directly proportional to the Euclidean distances between new and existing facilities. In this paper, it is shown that the dual of EMFL proposed by Francis and Cabot is equivalent to the maximization of a linear function subject to convex quadratic inequality constraints and therefore can be solved in polynomial time by interior point methods. We also establish a theorem on the duality gap and present a procedure for recovering the primal solution from an interior dual feasible solution.

关键词： polynomial time algorithm self-concordant barrier convex programming facilities location

来源：评论

学校读者我要写书评

暂无评论

A polynomial-time OPTIMAL algorithm FOR SATELLITE-SWITCHED time-DIVISION MULTIPLE ACCESS SATELLITE-COMMUNICATIONS WITH GENERAL SWITCHING MODES

引用

SIAM JOURNAL ON DISCRETE MATHEMATICS 1991年第1期4卷 28-35页

作者： BONUCCELLI, MA

The Satellite-Switched time-Division Multiple Access (SS/TDMA) is a technique effectively used in wideband communication satellites. A very important problem for SS/TDMA systems is the proper communications scheduling over the satellite equipment. This problem is equivalent to decomposing a given traffic matrix T into a positive linear combination of (0, 1)-matrices satisfying additional technology-dependant constraints. The sum of the multiplying constants represents the time taken by the satellite to handle the communications and must be minimum in order to achieve an efficient use of the equipment. A polynomial time optimal algorithm for the SS/TDMA scheduling problem for systems with variable bandwidth beams and restricted multiplexing and demultiplexing is presented. As a corollary of the presented results, another generalization of the classical Birkhoff-von Neumann Theorem is established.

关键词： NETWORK FLOW COMBINATORIAL OPTIMIZATION polynomial time algorithm BIRKOF-VONNEUMANN THEOREM

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：