We define infinitary combinatory reduction systems (iCRSs). This provides the first extension of infinitary rewriting to higher-order rewriting. We lift two well-known results from infinitary term rewriting systems and infinitary λ-calculus to iCRSs: 1. every reduction sequence in a fully-extended left-linear iCRS is compressible to a reduction sequence of length at most ω, and 2. every complet...

The convergence behaviors of so-called natural evolution strategies (NES) and of the information-geometric optimization (IGO) approach are considered. After a review of the NES/IGO ideas, which are based on information geometry, the implications of this philosophy w.r.t. optimization dynamics are investigated considering the optimization performance on the class of positive quadratic objective ...

This paper suggests an optimization-based methodology for the design of minimum weight structures with kinematic nonlinear behavior. Attention is focused on three-dimensional reticulated structures idealized with beam elements under proportional static loadings. The algorithm used for optimization is based on a classical optimality criterion approach using an active-set strategy for extreme lim...

A redex family is a set of redexes which arècreated in the same way'. Families specify which redexes should be shared in any so-called optimal implementation of a rewriting system. We formalise the notion of family for orthogonal higher-order term rewriting systems (OHRSs). In order to comfort our formalisation of the intuitive concept of family, we actually provide three conceptually diierent ...

This paper applies genetic optimization with an adaptive penalty function to the shapeconstrained unequal area facility layout problem. We implement a genetic search for unequal area facility layout, and show how optimal solutions are affected by constraints on permitted department shapes, as specified by a maximum allowable aspect ratio for each department. We show how an adaptive penalty func...

An accurate comparison of inter-individual 3D image datasets of brains requires warping techniques to reduce geometric variations. In this study we use a point-based method of warping with weighted sums of displacement vectors, which is extended by an optimization process. To improve the practicability of 3D warping, we investigate fast automatic procedures for determining landmarks. The combin...

In this work we present Evolution Strategies (ES) as an efficient optimization method for dynamic modelling of the main interacting group of three galaxies in M81. The M81 group is one of the nearest groups of galaxies; its biggest galaxy, M81, sits in the core of the group together with its two companions M82 and NGC3077. The interaction among these three galaxies is very well defined in an im...

An analysis of the dynamic behavior of Evolution Strategies applied to Trav-eling Salesman Problems is presented. For a special class of Traveling Salesman Problems a stochastic model of the optimization process is introduced. Based on this model diierent features determining the optimization process of Evolution Strategies are analyzed. In addition the stochastic model is extended to explain s...

Nowadays, traffic jams in urban areas have become a problem that keeps growing every year since the number of vehicles in our cities is continuously increasing. One of the most common causes producing traffic jams are vehicle accidents. Moreover, the arrival time of the emergency services could be raised due to traffic congestion. Intelligent Transportation Systems (ITS) have a key role in orde...

After the detection of the first extrasolar planet (exoplanet) more than one decade ago we currently know about more than 200 planets around other stars and there are about twenty multi-planet systems. Today’s most commonly used technique for identifying such exoplanets is based on radial velocity measurements of the star. Due to the increasing time span and accuracy of the respective observati...