Sciweavers

2474 search results - page 16 / 495
» Solving Problems on Parallel Computers by Cellular Programmi...
Sort
View
PPSN
1998
Springer
14 years 26 days ago
Solving Binary Constraint Satisfaction Problems Using Evolutionary Algorithms with an Adaptive Fitness Function
This paper presents a comparative study of Evolutionary Algorithms (EAs) for Constraint Satisfaction Problems (CSPs). We focus on EAs where fitness is based on penalization of cons...
A. E. Eiben, Jano I. van Hemert, Elena Marchiori, ...
IPPS
2005
IEEE
14 years 2 months ago
Some Issues in Solving the Anomaly Detection Problem using Immunological Approach
Results of an experimental study of an anomaly detection system based on the paradigm of artificial immune systems (AISs) are presented. Network traffic data are mapped into ant...
Franciszek Seredynski, Pascal Bouvry
CP
1999
Springer
14 years 28 days ago
Search Procedures and Parallelism in Constraint Programming
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...
Laurent Perron
ISPAN
2002
IEEE
14 years 1 months ago
A New Parallel Genetic Algorithm
One problem of propagating the globally fittest individual via neighbourhood evolving in both island model and cellular model of existing parallel genetic algorithms (PGA) is that...
Ling Tan, David Taniar, Kate A. Smith
TCS
2008
13 years 8 months ago
Solving NP-complete problems in the tile assembly model
Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed parallel model of computation that may be implemented using molecules ...
Yuriy Brun