Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
The generalized 1+N protection, protects N link disjointly provisioned unicast connections by a single Steiner tree connecting all end points of the connections. By sending network coded packets on the protection Steiner tree in parallel with the working traffic, 1+N is able to recover from any single link failure without enduring the delay from switching to the backup path. This makes 1+N a better...
A significant body of work in multiagent systems over more than two decades has focused on multi-agent coordination. Many challenges in multi-agent coordination can be modeled as Distributed Constraint Optimizations (DCOPs). Many complete and incomplete algorithms have been introduced for DCOPs but complete algorithms are often impractical for large-scale and dynamic environments which lead to study...
Reversible circuits have been intensively studied in recent years due to their applications in many areas, including quantum computing, nanotechnology and low-power design. Synthesis of reversible circuits differs significantly from the traditional logic synthesis. No satisfactory synthesis algorithm has been proposed for such circuits so far. All existing heuristic approaches to reversible logic...
Many applications in the Internet today demand high end-to-end Quality of Service (QoS) assurance, such as bandwidth, delay, jitter and packet loss constraints. Also they seek better utilization of the network resources, while satisfying customer needs. Multi-constrained optimal path (MCOP) QoS routing problem attempts to find a feasible path that satisfies the requested QoS constraints, while maintaining...
This paper presents a computationally efficient model predictive control algorithm applicable for linear time varying systems with bounded disturbances. The proposed algorithm is based on the use of an optimized dynamic terminal control law that makes a good control performance possible with an online optimization over relatively smaller horizon lengths. In particular, the use of a dynamic terminal...
A dynamic matrix control with PID structure (PID-DMC) is derived by adding proportion, integral and differential structure to the conventional cost function. However the complicated inversion computation of higher dimensional matrix is involved in the PID-DMC and it restrains the on-line application. This paper is devoted to decreasing computational complexity by exploring its internal mechanism and...
There are more than thirty years that the capacitated dynamic lot sizing problem has appeared which is more and more interested by researchers around the world. With the rapid development of environment problems in production process, lots of manufacturing companies focus on products return and remanufacturing. In order to accord with practical demand, this paper based on Richterpsilas remanufacturing...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.