Abstract—In this paper, we address the problem of selfadaptation in internet-scale service-oriented systems. Services need to adapt by select the best neighboring services solely...
Abstract— The increasing complexity and dynamics of logistic processes is creating significant new challenges for the management of goods transport. This is leading to increased...
Bernd-Ludwig Wenning, Andreas Timm-Giel, Dirk Pesc...
Dynamic nets are an extension of Petri nets where the net topology may change dynamically. This is achieved by allowing (i) tokens to be coloured with place names (carried on as da...
— The E∗ algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of ...
This paper introduces the Sigma algorithm that solves fault-tolerant mutual exclusion problem in dynamic systems where the set of processes may be large and change dynamically, pr...