Network administrators need a tool that detects the kind of applications running on their networks, in order to allocate resources and enforce security policies. Previous work sho...
Maxim Shevertalov, Edward Stehle, Spiros Mancoridi...
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 { 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...
In this paper, we tackle learning in distributed systems and the fact that learning does not necessarily involve the participation of agents directly in the inductive process itse...
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...
Alexander E. I. Brownlee, John A. W. McCall, Deryc...