Sciweavers

6517 search results - page 247 / 1304
» On optimal service selection
Sort
View
GECCO
2005
Springer
113views Optimization» more  GECCO 2005»
16 years 24 days ago
Estimating the detector coverage in a negative selection algorithm
This paper proposes a statistical mechanism to analyze the detector coverage in a negative selection algorithm, namely a quantitative measurement of a detector set’s capability ...
Zhou Ji, Dipankar Dasgupta
DAGM
2004
Springer
16 years 20 days ago
Adaptive Feature Selection in Image Segmentation
Most image segmentation algorithms optimize some mathematical similarity criterion derived from several low-level image features. One possible way of combining different types of f...
Volker Roth, Tilman Lange
GECCO
2003
Springer
16 years 15 days ago
Selection Intensity in Asynchronous Cellular Evolutionary Algorithms
Abstract. This paper presents a theoretical study of the selection pressure in asynchronous cellular evolutionary algorithms (cEAs). This work is motivated by the search for a gene...
Mario Giacobini, Enrique Alba, Marco Tomassini
GECCO
2003
Springer
113views Optimization» more  GECCO 2003»
16 years 15 days ago
The Effect of Binary Matching Rules in Negative Selection
Negative selection algorithm is one of the most widely used techniques in the field of artificial immune systems. It is primarily used to detect changes in data/behavior patterns...
Fabio A. González, Dipankar Dasgupta, Jonat...
AAAI
1998
15 years 8 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître