The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Algorithmic Background of the Host Recommendation in the Adaptive Distributed Multimedia Server”

An Electromagnetism Metaheuristic for the Uncapacitated Multiple Allocation Hub Location Problem

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,...

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...

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...

A model and an algorithm for the grouping problem in telecom networks.

F. García, K. D. Hackbarth (1991)

Qüestiió

Similarity:

This paper deals with the so called grouping problem which arises in telecommunication network optimization when transmission equipment with a certain hierarchy is used. It is shown how this problem is embedded in the complete scheme of network optimization and a general combinatorial model is developed to derive afterwards a solution procedure. The implementation of this procedure forms part of a software tool for the complete problem of transmission network planning. Some results deriving...

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...

Genetic Algorithm Approach for Solving the Task Assignment Problem

Savić, Aleksandar, Tošić, Dušan, Marić, Miroslav, Kratica, Jozef (2008)

Serdica Journal of Computing

Similarity:

This research was partially supported by the Serbian Ministry of Science and Ecology under project 144007. The authors are grateful to Ivana Ljubić for help in testing and to Vladimir Filipović for useful suggestions and comments. In this paper a genetic algorithm (GA) for the task assignment problem (TAP) is considered.An integer representation with standard genetic operators is used. Computational results are presented for instances from the literature, and compared to...

Solving the Task Assignment Problem with a Variable Neighborhood Search

Kratica, Jozef, Savić, Aleksandar, Filipović, Vladimir, Milanović, Marija (2010)

Serdica Journal of Computing

Similarity:

In this paper a variable neighborhood search (VNS) approach for the task assignment problem (TAP) is considered. An appropriate neighborhood scheme along with a shaking operator and local search procedure are constructed specifically for this problem. The computational results are presented for the instances from the literature, and compared to optimal solutions obtained by the CPLEX solver and heuristic solutions generated by the genetic algorithm. It can be seen that the proposed...