Recursive partitioning based placement has a long history, but there has been little consensus on how cut sequences should be chosen. In this paper, we present a dynamic programmi...
Abstract. We present a deterministic O(log n log log n) space algorithm for undirected stconnectivity. It is based on a space-efficient simulation of the deterministic EREW algorit...
Proposed and developed is a service composition framework for decision-making under uncertainty, which is applicable to stochastic optimization of supply chains. Also developed is ...
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
In this paper we describe an ant system algorithm (ASMC) for the problem of finding the maximum clique in a given graph. In the algorithm each ant has only local knowledge of the ...