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

6th international conference on Evolutionary programming, EP 1997

作者： Imada, Akira Araki, Keijiro Graduate School of Information Science Nara Institute of Science and Technology 8916-5 Takayama Ikoma Nara630-61 Japan Department of Computer Science and Computer Engineering Graduate School of Information Science and Electrical Engineering Kyusyu University 6-1 Kasuga-koen Kasuga Fukuoka816 Japan

ISBN: (纸本)9783540627883

We apply evolutionary computations to Hopfield model of associative memory. Although there have been a lot of researches which apply evolutionary techniques to layered neural networks, their applications to Hopfield neural networks remain few so far. Previously we reported that a genetic Mgorithm using discrete encoding chromosomes evolves the Hehb-rule associative memory to enhance its storage capacity. We also reported that the genetic algorithm evolves a network with random synaptic weights eventually to store some number of patterns as fixed points. In this paper we present an evolution of the Hopfield model of associative memory using evolutionary programming as a reM-valued parameter optimization. © Springer-Verlag Berlin Heidelberg 1997.

关键词： Associative processing

来源：评论

学校读者我要写书评

暂无评论

Exploring self-adaptive methods to improve the efficiency of generating approximate solutions to traveling salesman problems using evolutionary programming 6th

Exploring self-adaptive methods to improve the efficiency of...

引用

6th international conference on Evolutionary programming, EP 1997

作者： Chellapilla, Kumar Fogel, David B. Department of Electrical and Computer Engineering Villanova University VillanovaPA19085 United States Natural Selection Inc. 3333 N. Torrey Pines Ct. Suite 200 La JollaCA92037 United States

ISBN: (纸本)9783540627883

Self-adaptation is becoming a standard method for optimizing mutational parameters within evolutionary programming. the majority of these efforts have been applied to continuous optimization problems. this paper offers a preliminary investigation into the use of self-adaptation for discrete optimization using the traveling salesman problem. Two self-adaptive approaches are analyzed. the results indicate that the use of self-adaptation can yield statistically significantly improved solutions over the failure to use any self-adaptation at all. this improvement comes at the expense of greater computational effort. © Springer-Verlag Berlin Heidelberg 1997.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Applying family competition to evolution strategies for constrained optimization 6th

Applying family competition to evolution strategies for cons...

引用

6th international conference on Evolutionary programming, EP 1997

作者： Yang, Jinn-Moon Chen, Ying-Ping Horng, Jorng-Tzong Kao, Cheng-Yan Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan Department of Computer Science and Information Engineering National Central University Chungli Taiwan

ISBN: (纸本)9783540627883

this paper applies family competition to evolution strategies to solve constrained optimization problems. the family competition of Family Competition Evolution Strategy (FCES) can be viewed as a local competition involving the children generated from the same parent, while the selection is a global competition among all of the members in the population. According to our experimental results, the self-adaptation of strategy parameters with deterministic elitist selection may trap ESs into local optima when they are applied to heavy constrained optimization problems. By controlling strategy parameters with non-self adaptive rule, FCES can reduce the computation time of self-adaptive Gaussian mutation, diminish the complexity of selection from (m+l) to (m+m), and avoid to be premature. therefore, FCES is capable of obtaining better performance and saving the computation time. In this paper, FCES is compared with other evolutionary algorithms on various benchmark problems and the results indicate that FCES is a powerful optimization technique. © Springer-Verlag Berlin Heidelberg 1997.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Solving static and dynamic fuzzy constraint networks using evolutionary hill-climbing 6th

Solving static and dynamic fuzzy constraint networks using e...

引用

6th international conference on Evolutionary programming, EP 1997

作者： Dozier, Gerry Bowen, James Homaifar, Abdollah Esterline, Albert NASA Center for Autonomous Control Engineering North Carolina A and T State University GreensboroNC27411 United States Department of Computer Science National University of Ireland at Cork Cork Ireland

ISBN: (纸本)9783540627883

In this paper we combine the concept of evolutionary hillclimbing search with the systematic search concept of arc revision to form a hybrid system that quickly finds solutions to static and dynamic Fuzzy Constraint Truth Optimization Problems (FCTOPs). We compare the static and dynamic methods for solving FCTOPs using a test suite of an additional 250 randomly generated FCTOPs. In the static method, all the constraints of a FCTOP are known by the hybrid system at runtime. In the dynamic method, only half of the constraints of a FCTOP are known at run-time. Each time our hybrid system discovers a solution that satisfies all of the constraints of the the current network, one additional constraint is added. Results show that our algorithm performs exceptionally well in the presence of dynamic (incremental) constraints. © Springer-Verlag Berlin Heidelberg 1997.

关键词： Hybrid systems

来源：评论

学校读者我要写书评

暂无评论

A graduate course in computer integrated process operations

引用

COMPUTERS & CHEMICAL engineering 1997年第Sup期21卷 S255-S259页

作者： Doyle, FJ Pekny, JF Reklaitis, GV Venkatasubramanian, V School of Chemical Engineering Purdue University West Lafayette IN 47907-1283 USA

Computer-aided process operations management includes tasks such as process monitoring, regulatory control, data reconciliation, unit and plant-wide optimization, process fault diagnosis, supervisory control, planning and scheduling. Due to the inter-dependencies of these tasks, operations management involves coordination of these tasks in an integrated manner. the proliferation of disparate tools and techniques to carry out these different tasks imposes barriers to problem integration by fragmenting the system implementation and the solution process. Dealing with integration requires a careful choice of problem-solving paradigms, knowledge representation, search and reasoning techniques so as not to burden the individual tasks and at the same time providing a unified framework. In this course on computer integrated process operations, we addressed the nature of these operational tasks, the character of integration, the use of artificial intelligence, math programming and nonlinear modeling techniques that are necessary and inevitable for achieving this integration. this course brought state-of-the-art tools and techniques and industrial speakers and case studies to the class room to educate and prepare undergraduate and graduate students in current trends in computer-integrated manufacturing in the chemical process industries.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Evolving neural induction regular language using combined evolutionary algorithms 1

Evolving neural induction regular language using combined ev...

引用

1996 Mexico-USA Collaboration in Intelligent Systems Technologies - 1st Joint conference on Intelligent Systems between the 9th international Symposium on artificial Intelllgence, ISAI 1996 and the 6th international conference on Industrial Fuzzy Control and Intelligent Systems, IFIS 1996

作者： Yang, Jinn-Moon Kao, Cheng-Yan Horng, Jorng-Tzong Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan Department of Computer Science and Inforniation Engineering National Central University Chungli Taiwan

ISBN: (纸本)9682994373

this paper proposes a new algorithm called combined evolutionary algorithm (CEA) to train a neural network, and demonstrates its use in inducing thefinite state automata task. this algorithm evolves neural networks by incorporating the ideas of evolutionary programming(EP) and real coded genetic algorithms (RCGA) into evolution strategies (ESs). Simultaneously, we add the local competition into the CEA in order to reduce the complexity and maintain the diversity. this algorithm is able to balance the exploration and exploitation dynamically. We implement CEA and experiment on seven benchmark problems of regular language. the results indicate that the CF-4 is a powerful technique to construct neural networks. © 1996 ITESM.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Approximate string matching by finite automata 6th

引用

6th international conference on Computer Analysis of Images and Patterns, CAIP 1995

作者： Melichar, Bořivoj Department of Computer Science and Engineering Czech Technical University Karlovo ném. 13 Prague 2121 35 Czech Republic

ISBN: (纸本)3540602682

Approximate string matching is a sequential problem and therefore it is possible to solve it using finite automata. A nondeterministic finite automaton is constructed for string matching with k mismatches. It is shown, how "dynamic programming" and "shift-and" based algorithms simulate this nondeterministic finite automaton. the corresponding deterministic finite automaton have O(mk+1) states, where m is the length of the pattern and k is the number of mismatches. the time complexity of algorithms based on such deterministic finite automaton is O(n), where n is the length of text. © Springer-Verlag Berlin Heidelberg 1995.

关键词： Finite automata

来源：评论

学校读者我要写书评

暂无评论

RESOURCE-ALLOCATION IN A HIGH CLOCK RATE MICROPROCESSOR 6

RESOURCE-ALLOCATION IN A HIGH CLOCK RATE MICROPROCESSOR

引用

6th international conference on Architectural Support for programming Languages and Operating Systems

作者： UPTON, M HUFF, T MUDGE, T BROWN, R Department of Electrical Engineering and Computer Science University of Michigan

ISBN: (纸本)9780897916608

this paper discusses the design of a high clock rate (300MHz) processor. the architecture is described, and the goals for the design are explained. the performance of three processor models is evaluated using trace-driven simulation. A cost model is used to estimate the resources required to build processors with varying sizes of on-chip memories, in both single and dual issue models. Recommendations are then made to increase the effectiveness of each of the models.

关键词： nonblocking cache superscalar resource allocation pipelining floating point latencies prefetching decoupled architecture

来源：评论

学校读者我要写书评

暂无评论

Hardware and software support for efficient exception handling 6

Hardware and software support for efficient exception handli...

引用

6th international conference on Architectural Support for programming Languages and Operating Systems, ASPLOS 1994

作者： thelckath, Chandramohan A. Levy, Henry M. Department of Computer Science and Engineering University of Washington SeattleWA98195 United States DEC Systems Research Center 130 Lytton Avenue Palo AltoCA94301 United States

ISBN: (纸本)0897916603

Program-synchronous exceptions, for example, breakpoints, watch points, illegal opcodes, and memory access violations, provide information about exceptional conditions, interrupting the program and vectoring to an operating system handler. Over the last decade, however, programs and run-time systems have increasingly employed these mechanisms as a performance optimization to detect normal and expected conditions. Unfortunately, current architecture and operating system structures are designed for exceptional or erroneous conditions, where performance is of secondary importance, rather than normal conditions. Consequently, this has limited the practicality of such hardware-based detection mechanisms. We propose both hardware and software structures that permit efficient handling of synchronous exceptions by user-level code. We demonstrate a software implementation that reduces exceptiondelivery cost by an order-of-magnitude on current RISC processors, and show the performance benefits of that mechanism for several example applications. © 1994 ACM.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

the effectiveness of multiple hardware contexts 6

The effectiveness of multiple hardware contexts

引用

6th international conference on Architectural Support for programming Languages and Operating Systems, ASPLOS 1994

作者： thekkath, Radhika Eggetxt, Susan J. Department of Computer Science and Engineering University of Washington SeattleWA98195 United States

ISBN: (纸本)0897916603

Multithreaded processors are used to tolerate long memory latenties. By executing threads loaded in multiple hardware contexts, an otherwise idle processor can keep busy, thus increasing its utilization. However, the larger size of a multi-thread working set can have a negative effect on cache conflict misses. In this paper we evaluate the two phenomena together, examining their combined effect on execution time. the usefulness of multiple hardware contexts depends on: Program data locality, cache organization and degree of multiprocessing. Multiple hardware contexts are most effective on programs that have been optimized for data locality. For these programs, execution time dropped with increasing contexts, over widely varying architectures. With unoptimized applications, multiple contexts had limited *** best performance was seen with only two contexts, and only on uniprocessors and small multiprocessors. the behavior of the unoptimized applications changed more noticeably with variations in cache associativity and cache hierarchy, unlike the optimized programs. As a mechanism for exploiting program parallelism, an additional processor is clearly better than another context. However, there were many configurations for which the addition of a few hardware contexh brought as much or greater performance than a larger multiprocessor with fewer than the optimal number of contexts. © 1994 ACM.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：