We present a framework for building fail-safe hard real-time applications in timed asynchronous distributed systems subject to communication partitions and performance, omission, ...
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, ...
We investigate network management information for light-path assessment to dynamically set up end-to-end lightpaths across administrative domains. Our focus is on invetigating what...
Computer animation is one of the key components of a multimedia document or presentation. Shape transformation between objects of different topology and positions is an open model...
Galina Pasko, Alexander A. Pasko, M. Ikeda, Tosiya...
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...