This paper describes how to solve very large TravelingSalesman Problems heuristically by the parallelization of self-organizing maps on cluster architectures. The used way of para...
Hannes Schabauer, Erich Schikuta, Thomas Weish&aum...
Abstract. We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F , there is an endomorphism φ of F ...
Our research goal is to design systems that enable humans to teach tedious, repetitive, simple tasks to a computer. We propose here a learner/problem solver architecture for such ...
We present a practical approach to Anstreicher and Lee’s masked spectral bound for maximum-entropy sampling, and we describe favorable results that we have obtained with a Branch...
Abstract { This paper presents a parallel algorithm for solving the region growing problem based on the split and merge approach. The algorithm was implemented on the CM-2 and the ...
Nawal Copty, Sanjay Ranka, Geoffrey Fox, Ravi V. S...