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

3rd International Workshop on Ant Algorithms, ANTS 2002

作者： Merkle, Daniel Middendorf, Martin Institute for Applied Computer Science and Formal Description Methods University of Karlsruhe Germany Computer Science Group Catholic University of Eichstätt-Ingolstadt Germany

ISBN: (纸本)9783540457244

The behaviour of Ant Colony Optimization (ACO) algorithms is studied on optimization problems that are composed of different types of subproblems. Numerically exact results are derived using a deterministic model for ACO that is based on the average expected behaviour of the artificial ants. These computations are supplemented by test runs with an ACO algorithm on the same problem instances. It is shown that different scaling of the objective function on isomorphic subproblems has a strong influence on the optimization behaviour of ACO. Moreover, it is shown that ACOs behaviour on a subproblem depends heavily on the type of the other subproblems. This is true even when the subproblems are independent in the sense that the value of the objective function is the sum of the qualities of the solutions of the subproblems. We propose two methods for handling scaling problems (pheromone update masking and rescaling of the objective function) that can improve ACOs behaviour. Consequences of our findings for using ACO on realworld problems are pointed out. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Applying population based ACO to dynamic optimization problems 3rd

Applying population based ACO to dynamic optimization proble...

引用

3rd International Workshop on Ant Algorithms, ANTS 2002

作者： Guntsch, Michael Middendorf, Martin Institute for Applied Computer Science and Formal Description Methods University of Karlsruhe Germany Computer Science Group Catholic University of Eichstätt-Ingolstadt Germany

ISBN: (纸本)9783540457244

Population based ACO algorithms for dynamic optimization problems are studied in this paper. In the population based approach a set of solutions is transferred from one iteration of the algorithm to the next instead of transferring pheromone information as in most ACO algorithms. The set of solutions is then used to compute the pheromone information for the ants of the next iteration. The population based approach can be used to solve dynamic optimization problems when a good solution of the old instance can be modified after a change of the problem instance so that it represents a reasonable solution for the new problem instance. This is tested experimentally for a dynamic TSP and dynamic QAP problem. Moreover the behavior of different strategies for updating the population of solutions are compared. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

CardS4: Modal theorem proving on java smartcards

引用

International Conference on Research in Smart Cards, E-smart 2001

作者： Goré, Rajeev Prabhakar Nguyên, Phuong Thê Automated Reasoning Group Computer Sciences Laboratory Res. Sch. of Inf. Sci. and Eng Institute of Advanced Studies Australian National University Australia Formal Methods Group Dept. of Computer Science Inf. Tech Australian National University Australia

ISBN: (纸本)3540426108

We describe a successful implementation of a theorem prover for modal logic S4 that runs on a Java smart card with only 512 KBytes of RAM and 32KBytes of EEPROM. Since proof search in S4 can lead to infinite branches, this is "proof of principle" that non-trivial modal deduction is feasible even on current Java cards. We hope to use this prover as the basis of an on-board security manager for restricting the flow of "secrets" between multiple applets residing on the same card, although much work needs to be done to design the appropriate modal logics of "permission" and "obligations". Such security concerns are the major impediments to the commercial deployment of multi-application smart cards. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Smart cards

来源：评论

学校读者我要写书评

暂无评论

Task rearrangement on partially reconfigurable FPGAs with restricted buffer 10th

引用

10th International Conference on Field-Programmable Logic and Applications, FPL 2000

作者： Elgindy, Hossam Middendorf, Martin Schmeck, Hartmut Schmidt, Bernd School of Computer Science and Engineering University of New South Wales Sydney2052 Australia Institute of Applied Computer Science and Formal Description Methods University of Karlsruhe KarlsruheD-76128 Germany

ISBN: (纸本)3540678999

Partially reconfigurable FPGAs can be shared among multiple independent tasks. When partial reconfiguration is possible at runtime the FPGA controller can decide on-line were to place new tasks on the FPGA. Since on–line allocation suffers from fragmentation, tasks can end up waiting despite there being sufficient, albeit non–contiguous resources available to service them. Rearranging a subset of the tasks executing on the FPGA often allows the next pending task to be processed sooner. In this paper we study the problem of placing and rearranging tasks that are supplied by input streams which have constant data rates. When such tasks are rearranged, the arriving input data have to be buffered while the execution is suspended. We describe and evaluate a genetic algorithm for identifying and scheduling feasible rearrangements when moving tasks are reloaded from off–chip and buffer size is limited. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Parallel access to persistent multidimensional arrays from HPF applications using Panda 8th

引用

8th International Conference on High Performance Computing and Networking, HPCNEurope 2000

作者： Brezany, Peter Czerwiński, Przemys Law Świętanowski, Artur Winslett, Marianne Institute for Software Science University of Vienna Liechtensteinstrasse 22 ViennaA-1090 Austria Department of Statistics Operations Research and Computer Methods University of Vienna Universitätsstrasse 5 ViennaA-1010 Austria Database Research Laboratory Department of Computer Science University of Illinois 1304 W. Springfield UrbanaIL61801 United States

ISBN: (纸本)9783540675532

A critical performance issue for a number of scientific and engineering applications is the eficient transfer of data to secondary storage. Languages such as High Performance Fortran (HPF) have been introduced to allow programming distributed-memory systems at a relatively high level of abstraction. However, the present version of HPF does not provide appropriate constructs for controlling the parallel I/O capabilities of these systems. In this paper, constructs to specify parallel I/O operations on multidimensional arrays in the context of HPF are proposed. The paper also presents implementation concepts that are based on the HPF compiler developed at the University of Vienna and the parallel I/O runtime system Panda developed at the University of Illinois. Experimental performance results are discussed in the context of financial management and traffic simulation applications. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

Pheromone evaluation in Ant Colony Optimization

Pheromone evaluation in Ant Colony Optimization

引用

Annual Conference of Industrial Electronics Society

作者： D. Merkle M. Middendorf H. Schmeck Institute of Applied Computer Science and Formal Description Methods AIFB University of Karlsruhe Karlsruhe Germany

In ant colony optimization (ACO) artificial ants communicate by laying synthetic pheromone along the edges on their path through a decision graph. This attracts following ants so that they are likely to search in the same region of the search space. The problem of how pheromone information should be evaluated in ant systems is studied in this paper. The standard approach for pheromone evaluation is that, for every decision, ants use only the local pheromone values corresponding to the possible outcomes of this decision. We show that the optimization behaviour of an ant algorithm can be improved substantially when the ants use more pheromone information than just local pheromone values. This clearly indicates that the problem of pheromone evaluation is an important topic for ant colony optimization that deserves attention.

关键词： Ant colony optimization Single machine scheduling computer science

来源：评论

学校读者我要写书评

暂无评论

Preface

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 1999年 1621卷 v-vii页

作者： Fensel, Dieter Studer, Rudi University of Karlsruhe AIFB Institute for Applied Computer Science Formal Description Methods Karlsruhe Germany

来源：评论

学校读者我要写书评

暂无评论

Evolutionary domain covering of an inference system for function approximation 7th

Evolutionary domain covering of an inference system for func...

引用

7th Annual Conference on Evolutionary Programming, EP 1998

作者： Kosiński, Witold Weigl, Martyna Michalewicz, Zbigniew Division of Optical and Computer Methods in Mechanics Institute of Fundamental Technological Research Pofish Academy of Sciences Warsaw00-049 Poland Department of Computer Science University of North Carolina CharlotteNC28223 United States Institute of Computer Science Polish Academy of Sciences Warsaw01-237 Poland

ISBN: (纸本)3540648917

Many interesting and important problems related to the analysis of large numerical data can be formulated as a problem of approximating a function from a set of sample points. Any approximation method should provide minimum error at the given data samples and also should approximate values for other points of the function's domain. In this paper a method leading to clustering of multidimensional large numerical data is proposed. The method uses a problem-specific evolutionary algorithm which partitions the data space into clusters and forms membership functions of the fuzzy sets involved in the premise parts of the fuzzy rules. The proposed algorithm has a two-stage hierarchial organization. For the first stage, an evolutionary algorithm is used, where an individual in the population represents a cluster of data samples. Three specialized operators are defined to operate on such individuals. During the second stage, a greedy algorithm is used for finding a near-optimum covering. © Springer-Verlag Berlin Heidelberg 1998.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Transversal Graphs in Plan Merging and Related Problems

Transversal Graphs in Plan Merging and Related Problems

引用

第三届运筹学及其应用国际研讨会

作者： Martin Middendorf Vadim G.Timkovsky Institute for Applied Computer Science and Formal Description Methods University of Karlsruhe Star Data Systems Inc. 30 Wellington St.W.Suite 300P.O.Box 283Commerce Court South P.S.TorontoOntario M5L 1G1Canadaand Department of Computer Science & SystemsMcMaster University1280 Main St.W.HamiltonOntario L8S 4K1Canada

This paper introduces transversal graphs for plans(acyclic directed graphs with labeled vertices) and shows how to reduce various super- and subsequence problems on plans to searching paths in the transversal *** the concept of transversal graphs for sets of strings and the concept of maximal independent set graphs for plans, the transversal graphs for plans allow to solve a wider class of problems in plan merging,project planning,precedence constrained scheduling, manufacturing systems design and DNA sequencing.

关键词： Transversal Graphs in Plan Merging and Related Problems

来源：评论

学校读者我要写书评

暂无评论

Applying fuzzy functions and sequential coordination to optimization of machinery arrangement and pipe routing

引用

NAVAL ENGINEERS JOURNAL 1998年第6期110卷 43-54页

作者： Wu, BC Young, GS Schmidt, W Choppella, K Dr. Bi-Chu Wu:received a PhD in Mechanical Engineering from the University of Maryland College Park in 1991. She has worked on projects involving naval architecture design optimization solid mechanics and database development. Presently a senwr engineer with Angle Incorporated Dr Wu's research interests are in design optimization and fuzzy logic applications. Dr. Gin-Shu Young: a senior engineer with Angle Incorporated holds a PhD in Mechanical Engineering from the University of Maryland College Park. As a guest researcher with National Institute of Standards and Technologies from 1990 to 1993 he worked on vision-based navigation for autonomous vehicles. His experience also includes applications of optimization fuzzy logic neural network and genetic algorithm methods to engineering system design Mr. William Schmidt:co-founded Angle Incorporated in 1990 and has served as Vice PresidentlChiefScientist during this tame. He holds a B.Sc. in Applied Science from the Naval Acadt?my and an M.Sc. in Physics from the Naval Post Graduate School. He has cner 20 years experience in technical leadership material and personnel management. He has led the application of computer aided design (CAD) and Product Model Information Exchange to the shipbuilding industry. His experience also includes leading the amlication of model based operational analysis to support the Live Fire Test Program for DDG 51 Class Destroyers. Mr. Krishna M. Choppella:is a Sofware Engineer at Eidea Laboratories Incotporated where he works on componentbased distributed enterpvise frameworks. He has been involved in creating data analysis tools for the US Nay by integrating CAD modeis databases and graphical front ends. His work in the Masters degree program in Mechanical Engineering at the University of Texas at Austin was in di0ddase.r spectroscopy of combustion products in porous-matri burners. He received his Bachelors degree in Electrical Engineering in India. He was a Research Associate at the Centre for Laser Technology and Project Engi

Ship design is often multidisciplinary involving several design elements with various types of objectives and constraints (O/C) some easily described as mathematical formulas, others better modeled as descriptive assertions. This paper describes a method based on fuzzy functions and an integrated performance index to model O/C using descriptive assertions to be used with mathematical formulas in optimization. Another issue addressed in this paper concerns the coordination of design elements when sequentially coupled, that is, when one leads the other and the performance of the follower depends greatly on the design of the leader. Based on neuro-fuzzy techniques, the method described here coordinates and optimizes sequentially coupled elements. The two methods are applied to machinery arrangement (MA) and pipe routing (PR). Preliminary models for optimization of MA and PR are described considering convenience, producibility: engine room size, interference and location as factors in the O/C set. Some test results from MA/PR applications are presented and discussed. The methods are generic and can be extended to other elements in ship design. They are mutually independent and may be used separately Two advantages of their use are an improvement in overall performance and a reduction in the need for redesign of elements.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：