Wyniki wyszukiwania - Biblioteka Nauki

1

A document clustering method based on ant algorithms

100%

Machnik Ł.

|

tom Vol. 11, No 1-2

87-102

EN

Ant Algorithms, particularly the Ant Colony Optimization (ACO) metaheuristic, are universal, flexible and scalable because they are based on multi-agent cooperation. The increased demand for effective methods of managing large collections of documents is a sufficient stimulus to place the research on new applications of ant-based systems in the area of text document processing. The author presents an implementation of such a technique in the area of document clustering. Details of the ACO document clustering method and results of experiments are presented.

2

Ant algorithm for flow assignment in connection-oriented networks

100%

Walkowiak K.

|

tom 15

|

nr 2

205-220

EN

This work introduces ANB (bf Ant Algorithm for bf Non-bf Bifurcated Flows), a novel approach to capacitated static optimization of flows in connection-oriented computer networks. The problem considered arises naturally from several optimization problems that have recently received significant attention. The proposed ANB is an ant algorithm motivated by recent works on the application of the ant algorithm to solving various problems related to computer networks. However, few works concern the use of ant algorithms in the assignment of static flows in connection-oriented networks. We analyze the major characteristics of the ANB and try to explain its performance. We report results of many experiments over various networks.

3

Swarm intelligence for network routing optimization

100%

Dempsey P. , Schuster A.

|

tom nr 3

24-28

EN

This paper presents the results of a comparative study of network routing approaches. Recent advances in the field suggest that swarm intelligence may offer a robust, high quality solution. The overall aim of the study was to develop a framework to facilitate the empirical evaluation of a swarm intelligence routing approach compared to a conventional static and dynamic routing approach. This paper presents a framework for the simulation of computer networks, collection of performance statistics, generation and reuse of network topologies and traffic patterns.

4

Ant Algorithm for Flow Assignment in Connection-oriented Networks

75%

Walkowiak K.

|

2005

|

tom Vol. 15, no 2

205-220

EN

This work introduces ANB (Ant Algorithm for Non-Bifurcated Flows), a novel approach to capacitated static optimization of flows in connection-oriented computer networks. The problem considered arises naturally from several optimization problems that have recently received significant attention. The proposed ANB is an ant algorithm motivated by recent works on the application of the ant algorithm to solving various problems related to computer networks. However, few works concern the use of ant algorithms in the assignment of static flows in connection-oriented networks. We analyze the major characteristics of the ANB and try to explain its performance. We report results of many experiments over various networks.

5

Algorytmy stadne w optymalizacji problemów przydziału przy kwadratowym wskaźniku jakości (QAP)

63%

Filipowicz B. , Kwiecień J.

|

2011

|

tom T. 15, z. 2

159-166

PL

W artykule przedstawiono rozwiązanie kwadratowego problemu przydziału, który należy do AP-trudnych problemów optymalizacji dyskretnej, za pomocą algorytmów stadnych. Zastosowano trzy algorytmy: algorytmy mrówkowe, algorytmy optymalizacji rojem cząstek i algorytmy pszczele. Przedstawiono wyniki badań dla wybranych instancji testowych z biblioteki QAPLIB.

EN

This paper presents three swarm algorithms: ant algorithms, particle swarm optimization and bee algorithms, used for solution of quadratic assignment problem, which is a NP-hard optimization problem. The results of experiments performed for selected test problems of quadratic assignment problems from QAPLIB library have been also presented.

6

Ant colony opimization algorithms for clustering problems

63%

Schiff K.

|

tom R. 110, z. 4-AC

77--87

EN

The clustering problem is one of the main problems which can be encountered in a data analysis. This problem can be modelled by means of a graph; finding clusters means finding cliques in the graph. Often there is a need to find clusters (cliques) in a graph in different ways and to construct a list of clusters. This paper describes two such ways, these can be stated as the cluster minimum covering problem and the vertex cluster minimum partitioning problem. This paper describes new ant algorithms which were used in order to make a list of clusters in both presented problems, and also discusses the results of their comparison.

PL

Problem klasteryzacji jest jednym z często spotykanych problemów w analizie danych. Problem klasteryzacji może być zamodelowany przy pomocy grafów i znajdowanie klasterów sprowadza się wówczas do znajdowania klik w grafach. W tym artykule opisano dwa sposoby wyznaczania klasterów, czyli klik w grafach, takich jak: problem pokrycia klastrami (klikami) grafu oraz problem wierzchołkowego podziału grafu na klastry (kliki) oraz także przedstawiono dwa nowe algorytmy bazujące na zachowaniu mrówek służące do wyznaczania klastrów (klik) dla obu problemów, a także dokonano porównania ich ze znanymi algorytmami rozwiązującymi te problemy.