Current state-of-the-art methodologies are mostly developed for stationary optimization problems. However, many real world problems are dynamic in nature, where dierent types of changes may occur over time. Population based approaches, such as evolutionary algorithms are frequently used in dynamic environments. Selection hyper-heuristics are highly adaptive search methodologies that aim to rais...

Motivation With the advent of nanoscale technologies in semiconductors, the transistor dimensions have shrunk staggeringly. Forecasts indicate that by end of year 2010, multi-billion transistors with feature size of about 50nm and clock frequency more than 10 GHz will be under design [fSI08]. As number of functional blocks in a chip increases, delays in global wires become longer than the clock...

in this paper, some meteorological data, such as temperature, pressure and dew point temperature are used for extracting the atmospheric refractivity in different locations of iran. these data have been measured at different heights in twelve radiosonde sites of country by using meteorological balloons. the set of refractivity points obtained from data of each site are plotted as a function of ...

Given a link L ⊂ S 3 , a Seifert surface S for L is a compact, orientable surface with boundary L. The Euler characteristic χ(L) of the link L is dened to be the maximum over all Euler characteristics χ(S) of Seifert surfaces S for L. Seifert surfaces exist for all L, and this denition presents itself with the problem of calculating χ(L). An easily applicable method for producing Seifert surfac...

Epsilon technique cannot learn from training patterns with a contradiction | i.e. two or more training patterns have identical inputs but dierent outputs. These training patterns are not 100% satisable and the Descending Epsilon technique will not be able to reduce the value of epsilon beyond a limit. Secondly, the Descending Epsilon technique takes more cycles than normal back-propagation sinc...

The complexity of an algorithm is usually specied by the maximum number of steps made by the algorithm, as a function of the size of the input. However, as dierent inputs of equal size can yield dramatically dierent algorithm runtime, the size of the input is not always an appropriate basis for predicting algorithm runtime. In this paper, we argue that the compressed size of the input is more a...

As before, there is a tremendous variation in the topic-by-topic results, suggesting that a great deal more research is needed to nd how to get the best results in dierent routing and retrieval scenarios. We are encouraged by the progress of our system, as well as of the overall eld, in these experiments, and are hopeful that in the coming years we will learn how to combine our promising result...

Links: [1] http://www.fnb.upc.edu/content/n%C3%A0utica-esportiva [2] http://www.upcplus.com/site/curso/984/patro_embarcacions_esbarjo.aspx [3] http://147.83.193.78/nautica/ [4] http://www.upcplus.com/site/curso/983/patron_embarcaciones_recreo.aspx [5] http://www.upc.edu/esports/activitats/activitats-nautiques [6] http://www.upcplus.com/site/curso/1184/patron_navegacion_basica.aspx [7] http://ww...

Some typographical errors have been corrected. Figure 2 of this report is not complete in this version because it should contain some hand-drawn additional arcs. The reader, however, is able work out the details for herself. Abstract We construct and discuss innite 0-1-sequences which contain 2n dierent sub-words of length n, for every n.