Sciweavers

801 search results - page 4 / 161
» A Knowledge-theoretic Approach to Distributed Problem Solvin...
Sort
View
CEC
2007
IEEE
14 years 21 days ago
A genetic algorithm for solving the binning problem in networked applications detection
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...
PDCAT
2005
Springer
13 years 12 months ago
Solving Very Large Traveling Salesman Problems by SOM Parallelization on Cluster Architectures
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...
ICPP
1993
IEEE
13 years 10 months ago
Solving the Region Growing Problem on the Connection Machine
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...
IAT
2006
IEEE
14 years 12 days ago
Toward Inductive Logic Programming for Collaborative Problem Solving
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...
Jian Huang, Adrian R. Pearce
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
14 years 16 days ago
Solving the MAXSAT problem using a multivariate EDA based on Markov networks
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...