Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
We present a multi-agent formalism based on extended answer set programming. The system consists of independent agents connected via a communication channel, where knowledge and be...
Davy Van Nieuwenborgh, Marina De Vos, Stijn Heyman...
The Lorenz attractor is one of the best known examples of applied mathematics. However, much of what is known about it is a result of numerical calculations and not of mathematica...
Policy Based Management (PBM) is a research topic that has been driven by the tremendous complexity inherent in the administration and management of present-day networking and tel...
This paper addresses one of the major problems of SOA software development: the lack of support for testing complex service-oriented systems. The research community has developed v...