— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
Distributed problem solving by a multiagent system represents a promising approach to solving complex computational problems. However, many multiagent systems require certain degr...
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
We present an approach to the cell formation problem, known from group technology, which is inspired by formal concept analysis. The cell formation problem consists in allocating p...