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

CBACK - A SIMPLE TOOL FOR backtrack programming IN C

SOFTWARE-PRACTICE & EXPERIENCE 1995年第8期25卷 905-934页

作者： HELSGAUN, K Department of Computer Science Roskilde University DK-4000 Roskilde Denmark

backtrack programming is such a powerful technique for problem solving that a number of languages, especially in the area of artificial intelligence, have built-in facilities for backtrack programming. This paper describes CBack, a simple, but general tool for backtrack programming in the programming language C. The use of the tool is illustrated through examples of a tutorial nature. In addition to the usual depth-first search strategy, CBack provides for the more general heuristic best-first search strategy. The implementation of CBack is described in detail. The source code, shown in its full length, is entirely written in ANSI C and highly portable across diverse computer architectures and C compilers.

关键词： backtrack programming backtrackING C programming LANGUAGES

来源：评论

学校读者我要写书评

暂无评论

Cost-Sensitive Attribute Reduction in Decision-Theoretic Rough Set Models

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2014年第1期2014卷 1-9页

作者： Liao, Shujiao Zhu, Qingxin Min, Fan Univ Elect Sci & Technol China Sch Informat & Software Engn Chengdu 611731 Peoples R China Minnan Normal Univ Sch Math & Stat Zhangzhou 363000 Peoples R China Southwest Petr Univ Sch Comp Sci Chengdu 610500 Peoples R China

In recent years, the theory of decision-theoretic rough set and its applications have been studied, including the attribute reduction problem. However, most researchers only focus on decision cost instead of test cost. In this paper, we study the attribute reduction problem with both types of costs in decision-theoretic rough set models. A new definition of attribute reduct is given, and the attribute reduction is formulated as an optimization problem, which aims to minimize the total cost of classification. Then both backtracking and heuristic algorithms to the new problem are proposed. The algorithms are tested on four UCI (University of California, Irvine) datasets. Experimental results manifest the efficiency and the effectiveness of both algorithms. This study provides a new insight into the attribute reduction problem in decision-theoretic rough set models.

关键词： ROUGH sets DECISION theory MATHEMATICAL optimization backtrack programming HEURISTIC algorithms MATHEMATICAL analysis

来源：评论

学校读者我要写书评

暂无评论

Non-backtracking Loop Soups and Statistical Mechanics on Spin Networks

引用

ANNALES HENRI POINCARE 2017年第2期18卷 403-433页

作者： Camia, Federico Lis, Marcin New York Univ Abu Dhabi Abu Dhabi U Arab Emirates Vrije Univ Amsterdam Dept Math Boelelaan 1081a NL-1081 HV Amsterdam Netherlands Univ Cambridge Stat Lab Ctr Math Sci Wilberforce Rd Cambridge CB3 0WB England

We introduce and study a Markov field on the edges of a graph in dimension whose configurations are spin networks. The field arises naturally as the edge-occupation field of a Poissonian model (a soup) of non-backtracking loops and walks characterized by a spatial Markov property such that, conditionally on the value of the edge-occupation field on a boundary set that splits the graph into two parts, the distributions of the loops and arcs contained in the two parts are independent of each other. The field has a Gibbs distribution with a Hamiltonian given by a sum of terms which involve only edges incident on the same vertex. Its free energy density and other quantities can be computed exactly, and their critical behavior analyzed, in any dimension.

关键词： MARKOV processes STATISTICAL mechanics backtrack programming GIBBS phenomenon HAMILTONIAN systems

来源：评论

学校读者我要写书评

暂无评论

Cut Points in PEG

引用

FUNDAMENTA INFORMATICAE 2016年第1-2期143卷 141-149页

作者： Redziejowski, Roman R. Ceremonimastarvagen 10 SE-18140 Lidingo Sweden

Parsing Expression Grammar (PEG) encodes a recursive-descent parser with limited backtracking. It has been recently noticed that in the situation when the parser is to explore several alternatives one after another, no further alternatives need to be explored after the parser reached certain "cut point". This fact can be used to save both processing time and storage. The subject of the paper is identification of cut points, which can also help in producing better diagnostics.

关键词： Parsing (Computer grammar) Expression backtrack programming Recursive functions Data analysis

来源：评论

学校读者我要写书评

暂无评论

Developing Heuristic for Subgraph Isomorphism Problem

Developing Heuristic for Subgraph Isomorphism Problem

引用

5th International Conference on Contemporary Computing

作者： Kaijar, Saifuddin Bhavani, S. Durga Univ Hyderabad Dept Comp & Informat Sci Hyderabad 500134 Andhra Pradesh India

ISBN: (纸本)9783642321283

Subgraph isomorphism problem is an NP-hard problem and the available algorithms are of exponential time complexity. Hence these are not efficient for real world applications. A number of heuristic methods are proposed in the literature in this field. Ullmann[6] proposed a solution for subgraph isomorphism problem in 1976, which is being referred till today. Ullmann's algorithm is refined to get better algorithms in current literature. Cordella et al.[7] proposed an algorithm VF2, that improves Ullmann's refinement. In this project, we propose a heuristic to be applied to Ullmann's algorithm in order to reduce the search space. We show that the proposed heuristic performs better than both Ullmann's and VF2 algorithm. The testing is done using a graph generation software[12]. Further the heuristic algorithm is tested on the benchmark data set [4]. Both the experiments show that our proposed heuristics perform better for all type of graphs given in the benchmark data set.

关键词： backtrack programming graph similarity measure isomorphism graph matching

来源：评论

学校读者我要写书评

暂无评论

A Mathematical programming Model for Cell Formation Problem with Machine Replication

引用

JOURNAL OF APPLIED MATHEMATICS 2013年第unknown期2013卷 1-9页

作者： Raminfar, Reza Zulkifli, Norzima Vasili, Mohammadreza Univ Putra Malaysia Dept Mech & Mfg Engn Serdang Malaysia Islamic Azad Univ Lenjan Branch Dept Ind Engn Esfahan Iran

Cell formation (CF) is a crucial aspect in the design of cellular manufacturing (CM) systems. This paper develops a comprehensive mathematical programming model for the cell formation problem, where product demands, cell size limits, sequence of operations, multiple units of identical machines, machine capacity, or machine cost are all considered. In this model, the intercell moves are restricted to be unidirectional from one cell to the downstream cells, without backtracking. The proposed model is investigated through several numerical examples. To evaluate the solution quality of the proposed model, it is compared with some well-known cell formation methods from the literature, by using group capability index (GCI) as a performance measure. The results and comparisons indicate that the proposed model produces solution with a higher performance.

关键词： MATHEMATICAL programming MANUFACTURING cells backtrack programming COMPUTER programming PRODUCTION engineering MACHINERY FUNCTIONAL equations

来源：评论

学校读者我要写书评

暂无评论

The specification of program flow in Madcap 6 72

The specification of program flow in Madcap 6

引用

1972 ACM Annual Conference/Annual Meeting, ACM 1972

作者： Morris, James B. Wells, Mark B. Los Alamos Scientific Laboratory University of California United States

ISBN: (纸本)9781450374927

The control structures of the Madcap language have evolved to a point where today those of Madcap 6 have obviated programmer defined labels and go-to statements. The benefits of the removal of these concepts are discussed in detail. Madcap has a powerful class of data structures, including sets, sequences, and expressions, along with a full array of operators for manipulating these structures. These operators include important facilities for forming sets and for forming and concatenating sequences, based on very general iterative expressions. Procedures in Madcap are expressions whose evaluation is deferred;characteristics of this approach are discussed. Also described is a notation which facilitates backtrack programming. © 1972 Association for Computing Machinery Inc. All rights reserved.

关键词： Program flow Recursive procedures Madcap Iterative expressions backtrack programming Go-to removal Control structures Expression language Conditional expressions Two-dimensional language Set theory Co-routines Programmer defined labels Bliss

来源：评论

学校读者我要写书评

暂无评论

THE WORLDS FASTEST SCRABBLE PROGRAM

引用

COMMUNICATIONS OF THE ACM 1988年第5期31卷 572-&页

作者： APPEL, AW JACOBSON, GJ CARNEGIE MELLON UNIV DEPT COMP SCIPITTSBURGHPA 15213

Describes an efficient backtracking algorithm that allows a very fast program to play the SCRABBLE Brand Crossword Game. Efficiency achieved by creating data structures before the backtracking search begins; Focusing ... 详细信息

关键词： backtrack programming SCRABBLE (Game) ALGORITHMS COMPUTER games

来源：评论

学校读者我要写书评

暂无评论

AN ALGORITHM FOR EXHAUSTIVE GENERATION OF BUILDING FLOOR PLANS

引用

COMMUNICATIONS OF THE ACM 1981年第12期24卷 813-825页

作者： GALLE, P Nordisk Kollegium Denmark

The combinatorial complexity of most floor plan design problems makes it practically impossible to obtain a systematic knowledge of possible solutions using pencil and paper. The objective of this paper is to contribute to the development of computer methods providing such knowledge for the designer. The paper describes an algorithm which generates all possible rectangular plans on modular grids with congruent cells, subject to constraints on total area, room areas, wall lengths, room adjacencies, and room orientations. To make room sizes regular and limit the solution set only such grids are used which minimize the number of cells in the smallest room. The description is sufficiently detailed to serve as a basis for programming. Test results for a Pascal implementation of the algorithm are reported. Realistic problems of up to ten rooms have been solved in modest lengths of computer time The results indicate that the approach of exhaustive generation may prove to be more fruitful than generally assumed. [ABSTRACT FROM AUTHOR]

关键词： architecture automated design backtrack programming combinatorial programming exhaustive tree search floor plans space planning

来源：评论

学校读者我要写书评

暂无评论

PACKED SCATTER TABLES

引用

COMMUNICATIONS OF THE ACM 1978年第10期21卷 857-865页

作者： LYON, G National Bureau of Standards Washington DC

Compares the retrieval time of scatter tables with conventional methods. Accessibility of item in scatter table by hash function; Suitability of techniques for fixed tables with known reference frequencies; Improvemen... 详细信息

关键词： assignment problem backtrack programming hashing open addressing recursion scatter table rearrangements

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：