J.K. Lenstra, A.H.G. Rinnooy (1981)
Qüestiió
Similarity:
This is a tutorial survey of recent results in the area of multiprocessor scheduling. Computational complexity theory provides the framework in which these results are presented. They involve on one hand the development of new polynomial optimization algorithms, and on the other hand the application of the concept of NP-hardness as well as the analysis of approximation algorithms.
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...
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...
Mario Furnari, Antonio Massarotti (1988)
Stochastica
Similarity:
In this note we discuss some drawbacks of some approaches to the classification of NP-complete optimization problems. Then we analyze the Theory of Analytical Computational Complexity to gain some insight about the notions of approximation and approximate algorithms. We stress the different roles played by these notions within the theories of Analytical and Algebraic Complexity. We finally outline a possible strategy to capture a more useful notion of approximation which is inspired...
Anna Styrcz, Janusz Mrozek, Grzegorz Mazur (2011)
International Journal of Applied Mathematics and Computer Science
Similarity:
A novel, neural network controlled, dynamic evolutionary algorithm is proposed for the purposes of molecular geometry optimization. The approach is tested for selected model molecules and some molecular systems of importance in biochemistry. The new algorithm is shown to compare favorably with the standard, statically parametrized memetic algorithm.
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...
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...
Filipović, Vladimir (2011)
Serdica Journal of Computing
Similarity:
In this article, the results achieved by applying an electromagnetism (EM) inspired metaheuristic to the uncapacitated multiple allocation hub location problem (UMAHLP) are discussed. An appropriate objective function which natively conform with the problem, 1-swap local search and scaling technique conduce to good overall performance.Computational tests demonstrate the reliability of this method, since the EM-inspired metaheuristic reaches all optimal/best known solutions for UMAHLP,...