W pracy rozważa się rozproszony model obliczeń, w którym struktura systemu jest reprezentowana przez graf bezpośrednich połączeń komunikacyjnych. W tym modelu podajemy nowy samostabilizujący algorytm kolorowania grafów oparty na konstrukcji drzewa spinającego. Zgodnie z naszą wiedzą jest to pierwszy algorytm z gwarantowaną wielomianową liczbą ruchów, który dokładnie koloruje grafy dwudzielne.

In this paper we present the architectural implementation of Flow Aware Networking (FAN), a new approach for realizing QoS guarantees in the Internet. We also propose FAN traffic control algorithm which performs traffic control on flow level. Using the proposed FAN node model, we conduct simulation research to prove if FAN can be a new approach for realizing QoS guarantees. The basis of this research is finding a way to guarantee...

We consider the following on-line pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown network. Their goal is to execute a search strategy that guarantees capturing a fast and invisible intruder regardless of its movements using as few searchers as possible. As a way of modeling two-dimensional shapes, we restrict our attention to networks that are embedded into partial grids:...

Local stability analysis of a recently proposed recursive feedback-based approach to spectral factorization is performed. The method is found not to give stability guarantees. Interestingly enough, its global behavior often allows one to obtain reasonable approximations of spectral factorizations if a suitable stopping criterion is employed.