Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
In complex systems, it is difficult to identify which system element is involved in which requirement. In this article, we present a new approach for expressing and validating a ...
An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of G...
In the dynamic load balancing problem, we seek to keep the job load roughly evenly distributed among the processors of a given network. The arrival and departure of jobs is modeled...
Abstract. This paper presents a grid-enabled system for solving largescale optimization problems. The system has been developed using Globus and MPICH-G2 grid technologies, and con...