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

Performance analysis of ACO on the Quadratic Assignment Problem

Chinese Journal of Electronics 2018年第1期27卷 26-34页

作者： XIA Xiaoyun ZHOU Yuren College of Mathematics Physics and Information Engineering Jiaxing University School of Data and Computer Science Sun Yat-sen University

The Quadratic assignment problem(QAP)is to assign a set of facilities to a set of locations with given distances between the locations and given flows between the facilities such that the sum of the products between flows and distances is minimized, which is a notoriously difficult NP-hard combinatorial optimization problem. A lot of heuristics have been proposed for the QAP problem, and some of them have proved to be efficient approximation algorithms for this problem. Ant colony optimization(ACO) is a general-purpose heuristic and usually considered as an approximation algorithms for NP-hard optimization problems. However, we know little about the performance of ACO for QAP from a theoretical perspective. This paper contributes to a theoretical understanding of ACO on the QAP problem. The worst-case bound on a simple ACO algorithm called(1+1) Max-min ant algorithm((1+1) MMAA) for the QAP problem is *** is shown that a degenerate(1+1) MMAA finds an approximate solution on the QAP problem. Finally, we reveal that ACO can outperform the 2-exchange local search algorithm on an instance of the QAP problem.

关键词： Ant colony optimization(ACO) Quadratic assignment problem(QAP) Approximation algorithms Local search algorithms analysis Runtime analysis

来源：评论

学校读者我要写书评

暂无评论

OPTAC: A portable software package for analyzing and comparing optimization methods by visualization

引用

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 1996年第1期72卷 41-62页

作者： Androulakis, GS Vrahatis, MN UNIV PATRAS DEPT MATH GR-26110 PATRAS GREECE

A software package for analyzing and comparing optimization methods is presented. This package displays, using different colors. the regions of convergence to the minima of a given function for various optimization methods. It displays also the rate of their convergence as well as the regions of divergence of the sr methods. Moreover, this, package gives quantitative information regarding the total convergence area in a specific domain for various minima. Using OPTAC (OPTimization analysis and Comparisons) we are able to ''see'' in a picture the advantages and disadvantages of any optimization method as well as to compare various methods in order to choose the proper method for a given class of problems. The OPTAC package is self-contained and conforms to the ANSI 1977 Fortran standards.

关键词： analyzing and comparing optimization methods software package algorithms analysis

来源：评论

学校读者我要写书评

暂无评论

Rationale of Students' Failure in Comprehending Theoretical Computer Science Courses

Rationale of Students' Failure in Comprehending Theoretical ...

引用

International Conference on Computer and Information Sciences (ICCOINS)

作者： Qureshi, Muhammad Aasim Hassan, Mohd Fadzil Sammi, Rabia Univ Teknol PETRONAS Comp & Informat Sci Dept Tronoh Perak Malaysia

ISBN: (纸本)9781479943913

Being a good IT solution provider one require good programming background. For a good programmer one need to have a solid back ground of algorithms i.e. theoretical aspects of the computer science. Most of the students of computer science do not understand the importance and do not give proper attention to Theoretical Computer Science (TCS) courses. As a result perform bad in these specialized courses. Intention of this research is to find the reasons of students' failure in grasping the subject matter in the light of the feedback of currently studying students as well as well experienced teachers and professionals. The study resulted in a set of suggestions including the usage of better simulation tools, better environment, visualization, etc.

关键词： Theoretical Computer Science Computer Science Teaching Learning Survey algorithms analysis

来源：评论

学校读者我要写书评

暂无评论

Combinatorial Dominance Guarantees for Problems with Infeasible Solutions

引用

ACM TRANSACTIONS ON algorithms 2008年第1期5卷 1–29页

作者： Berend, Daniel Skiena, Steven S. Twitto, Yochai Ben Gurion Univ Negev Dept Math IL-84105 Beer Sheva Israel Ben Gurion Univ Negev Dept Comp Sci IL-84105 Beer Sheva Israel SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA

The design and analysis of approximation algorithms for NP-hard problems is perhaps the most active research area in the theory of combinatorial algorithms. In this article, we study the notion of a combinatorial dominance guarantee as a way for assessing the performance of a given approximation algorithm. An f(n) dominance bound is a guarantee that the heuristic always returns a solution not worse than at least f(n) solutions. We give tight analysis of many heuristics, and establish novel and interesting dominance guarantees even for certain inapproximable problems and heuristic search algorithms. For example, we show that the maximal matching heuristic of VERTEX COVER offers a combinatorial dominance guarantee of 2(n) - (1.839+ o(1))(n). We also give inapproximability results for most of the problems we discuss.

关键词： Computation complexity approximation algorithms algorithms analysis dominance analysis

来源：评论

学校读者我要写书评

暂无评论

LOPDF: a framework for extracting and producing open data of scientific documents for smart digital libraries

引用

PEERJ COMPUTER SCIENCE 2021年 7卷 e445页

作者： Aslam, Muhammad Ahtisham King Abdulaziz Univ Fac Comp & Informat Technol Dept Informat Syst Jeddah Makkah Saudi Arabia

Background. Results of scientific experiments and research work, either conducted by individuals or organizations, are published and shared with scientific community in different types of scientific publications such as books, chapters, journals, articles, reference works and reference works entries. One aspect of these documents is their contents and the other is metadata. Metadata of scientific documents could be used to increase mutual cooperation, find people with common interest and research work, and to find scientific documents in the matching domains. The major issue in getting these benefits from metadata of scientific publications is availability of these data in unstructured (or semi-structured) format so that it can not be used to ask smart queries that can help in computing and performing different types of analysis on scientific publications data. Also, acquisition and smart processing of publications data is a complicated as well as time and resource consuming task. Methods. To address this problem we have developed a generic framework named as Linked Open Publications Data Framework (LOPDF). The LOPDF framework can be used to crawl, process, extract and produce machine understandable data (i.e., LOD) about scientific publications from different publisher specific sources such as portals, XML export and websites. In this paper we present the architecture, process and algorithm that we developed to process textual publications data and to produce semantically enriched data as RDF datasets (i.e., open data). Results. The resulting datasets can be used to make smart queries by making use of SPARQL protocol. We also present the quantitative as well as qualitative analysis of our resulting datasets which ultimately can be used to compute the research behavior of organizations in rapidly growing knowledge society. Finally, we present the potential usage of producing and processing such open data of scientific publications and how results of performing smart

关键词： Digital libraries Ontological reasoning Open data algorithms analysis

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for line clipping by convex and non-convex polyhedra in E(3)

引用

COMPUTER GRAPHICS FORUM 1996年第1期15卷 61-68页

作者： Skala, V Department of Informatics and Computer Science University of West Bohemia Americká 42 Box 314 306 14 Plzen Czech Republic Email: skala@kiv.zcu.cz

A new algorithm for clipping lines against convex polyhedron with O(N) complexity is given with modification for non-convex polyhedron. The suggested algorithm is faster for higher number of facets of the given polyhedron than the traditional Cyrus-Beck's algorithm. Some principal results of comparison of all algorithms are shown and give some ideas how the proposed algorithm could be used effectively.

关键词： line clipping convex polyhedron non-convex polyhedron computer graphics algorithm complexity geometric algorithms algorithms analysis

来源：评论

学校读者我要写书评

暂无评论

Realizable Fuzzy Petri Net of Feedback

Realizable Fuzzy Petri Net of Feedback

引用

2008年国际电子商务、工程及科学领域的分布式计算和应用学术研讨会

作者： Lingdong Kong~(1,2)Hong Zhang~3 Lifang Kong~1 1 School of Environment and Spatial Informatics,China University of Mining and Technology Xuzhou,Jiangsu 221008,China 2 Department of Software Engineering,Yancheng Institute of Technology Yancheng,Jiangsu 224003,China 3 School of Computers Science and Technology,China University of Mining and Technology Xuzhou,Jiangsu 221008,China

Reliability was believed as the first basic standpoint of the system model of Petri *** this paper,the state components and transition components of Fuzzy Petri net were expanded locally based on analysis of Petri Net fuzzy features,it not only expresses fuzzy knowledge but also was realized with facility using program to *** with characteristics of knowledge expressions in gas outburst prediction,a reasoning mechanism of fuzzy Petri net was given and a fuzzy Petri net of feedback that can be realized was put forward,at the same time,it was given a detailed description about algorithms analysis.

关键词： Fuzzy Knowledge Expression Fuzzy Petri Net Reliability Feedback algorithms analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：