Displaying similar documents to “A neural-network controlled dynamic evolutionary scheme for global molecular geometry optimization”

A comparative evaluation of medium- and large-scale feature selectors for pattern classifiers

Mineichi Kudo, Jack Sklansky (1998)

Kybernetika

Similarity:

Needs of feature selection in medium and large problems increases in many fields including medical and image processing fields. Previous comparative studies of feature selection algorithms are not satisfactory in problem size and in criterion function. In addition, no way has not shown to compare algorithms with different objectives. In this study, we propose a unified way to compare a large variety of algorithms. Our results show that the sequential floating algorithms promises for...

Algorithmic Background of the Host Recommendation in the Adaptive Distributed Multimedia Server

Szkaliczki, Tibor, Goldschmidt, Balázs, Böszörmenyi, Laszlo (2007)

Serdica Journal of Computing

Similarity:

Partial support of the Hungarian State Eötvös Scholarship, the Hungarian National Science Fund (Grant No. OTKA 42559 and 42706) and the Mobile Innovation Center, Hungary is gratefully acknowledged. In a distributed server architecture an obvious question is where to deploy the components. Host recommendation, which gives the answer, faces problems such as server selection, host deployment and, in case of multimedia servers, video replication. It is especially relevant for the...

Hybrid approach to design optimisation: preserve accuracy, reduce dimensionality

Mariusz Kamola (2007)

International Journal of Applied Mathematics and Computer Science

Similarity:

The paper proposes a design procedure for the creation of a robust and effective hybrid algorithm, tailored to and capable of carrying out a given design optimisation task. In the course of algorithm creation, a small set of simple optimisation methods is chosen, out of which those performing best will constitute the hybrid algorithm. The simplicity of the method allows implementing ad-hoc modifications if unexpected adverse features of the optimisation problem are found. It is postulated...

An approach based on the use of the ant system to design combinational logic circuits.

Benito Mendoza García, Carlos A. Coello Coello (2002)

Mathware and Soft Computing

Similarity:

In this paper we report the first attempt to design combinational logic circuits using the ant system. In order to design circuits, a measure of quality improvement in partially built circuits is introduced and a cost metric (based on the number of gates) is adopted in order to optimize the feasible circuits generated. The approach is compared to a genetic algorithm and to a human designer using several examples and the sensitivity of the algorithm to its parameters is studied using...

On Solving the Maximum Betweenness Problem Using Genetic Algorithms

Savić, Aleksandar (2009)

Serdica Journal of Computing

Similarity:

In this paper a genetic algorithm (GA) is applied on Maximum Betweennes Problem (MBP). The maximum of the objective function is obtained by finding a permutation which satisfies a maximal number of betweenness constraints. Every permutation considered is genetically coded with an integer representation. Standard operators are used in the GA. Instances in the experimental results are randomly generated. For smaller dimensions, optimal solutions of MBP are obtained by total enumeration. For...

Efficiency of some algorithms for prediction in finite stationary time series

Pavel Ranocha (2004)

Kybernetika

Similarity:

Important characteristics of any algorithm are its complexity and speed in real calculations. From this point of view, we analyze some algorithms for prediction in finite stationary time series. First, we review results developed by P. Bondon [1] and then, we derive the complexities of Levinson and a new algorithm. It is shown that the time needed for real calculations of predictions is proportional to the theoretical complexity of the algorithm. Some practical recommendations for the...