Aplikovaná matematika a doprava
Ako minimalizovať nepravidelnosť?
A note to independent sets in scheduling
The paper studies the bus-journey graphs in the case when they are piecewise expanding and contracting (if described by fathers-sons relations starting with the greatest independent set of nodes). This approach can make it possible to solve the minimization problem of the total service time of crews.
Multi-polarized graphs
Information transmission in the case of coding by finite automata
Synthesis of non-initial automata
O analýze neiniciálových automatov
Note on Stochastic Transformers
Poznámka k homogénnym experimentom s konečnými automatmi
Location of polygon vertices on circles and its application in transport studies
The paper deals with the problem how to locate a set of polygon vertices on given circles fulfilling some criteria of "regularity" of individual and composed polygons. Specifying the conditions we can obtain a lot of particular versions of this general problem. Some of them are already solved, the others are not. Applications of this theory can be found in scheduling of periodically repeating processes, e.g. in coordination of several urban lines on a common leg, in optimization of the rhythm of...
On Simple Stochastic Models
On directable automata
Observability of a graph
O aplikáciach matematiky
Page 1