Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  circular graphs
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Some lower bounds on the Shannon capacity
EN
In the paper we present a measure of a discrete noisy channel, named the Shannon capacity, which is described in the language of graph theory. Unfortunately, the Shannon capacity C0 is difficult to calculate, so we try to estimate the value of C0 for specific classes of graphs, i.e. circular graphs.
EN
The paper presents the project of a multimedia system of wide and fast information on the transport routes dealing with their current conditions. The system has a module structure and it is combined of four modules which institute a subject of the presented discussions and conclusions. Considerable part of the article is devoted to the method of the switching circuit property applications to creation of the selection algorithm of a transport route according to a defined criterion, leading to automation of continuous information process.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.