V práci je prezentovaná moderná paradigma darvinovskej evolúcie, ktorá ju chápe ako univerzálny optimalizačný algoritmus, aplikovateľný nielen v biologických vedách, ale aj v roznych oblastiach tak exaktných, ako aj sociálnych a behaviorálnych vied., Vladimír Kvasnička, Jiří Pospíchal., and Obsahuje bibliografii
The predictive performance of Echo State neural networks were optimized for electrical load forecasting and compared to the results achieved by competitors in the worldwide Eunite Competition #1. The test data used were the actual results of the competition, attached to a specific region. A regular adaptation of an \textit{Echo State }neural network was optimized by adapting the weights of the dynamic reservoir through Anti-Hebbian learning, and the weights from input and output neurons to the hidden neurons were optimized using the Metropolis algorithm. The results achieved with such an optimized Echo State neural network would gain a strong second place within the Eunite competition.
A simple replication theory of coevolution of genes and memes is
proposed. A population composed of couples of genes and memes, the so-called m-genes, is subjected to Darwinian evolution. Three diíferent types of operations over m-genes are introduced: Replication (an m-gene is replicated with mutations onto an offspring m-gene), interaction (a memetic transfer from a donor to an acceptor), and extinction (an m-gene is eliminated). Computer simulations of the present model allow us to identify diíferent mechanisms of gene and meme coevolutions.
Simulated annealing construction of shortest (spanning/nonspanning
and closed/open) paths on generál connected graphs is discussed. A brief graphtheoretical analysis of the problem is given. A theorem has been proved that for connected graphs the shortest paths are semielementary, that is each edge on the path is visited at most twice in opposite directions. This observation considerably reduces the search space. Tasks may be further specified depending on whether the initial and terminal vertices are given or not. Similarly, in construction of shortest open paths a subtask is considered when the path must visit a prescribed subset of graph vertices. Illustrative calculations demonstrate that the proposed method results for incomplete graphs in the paths that are dosely related to optimal solutions.