Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: connections graph

Sortuj według:

Ogranicz wyniki do:

The kernel and shell structure as a tool for improving the graph of transportation connections

Mażbic-Kulma B., Owsiński J. W., Sęp K., Stańczak J.

Operations Research and Decisions

2013

Vol. 23, No. 2

91--105

A model of a transportation system is expected to be useful in simulations of a real system to solve given transportation tasks. A connection graph is routinely used to describe a transportation system. Vertices can be train stations, bus stops, airports etc. The edges show direct connections between vertices. A direct approach can be difficult and computational problems can arise in attempts to organize or optimize such a transportation system. Therefore, a method for aggregating such graphs was introduced, using a general kernel and shell structure and its particular instances: α-clique structured graphs of connections and a hub and spoke transformation of the source graph. These structures enable the concentration and ordering of transport between vertices and reduction of the analyzed graph. To obtain the desired structures, several versions of a specialized evolutionary algorithm were developed and applied.

Searching the space of cellular automata basing on the analysis of the connections graphs

Porębska A.

Poznan University of Technology Academic Journals. Electrical Engineering

2010

No. 61

7-15

The paper describes the idea of searching the space of 2D cellular automata rules using the graphs of connections. Nodes are the "one" cells in the configurations for which the rule takes the value "1". Branches of a graph connect all "ones" in given configuration. The same graph when only rotated or mirror reflected is connected with group of rules, which generate the same behaviour of the cellular automaton. Thanks to that the computer investigation of automata space, in order to extract automata with interesting behaviour, can be reduced to test representatives of distinguish groups.