Sciweavers

938 search results - page 145 / 188
» On the Design of Adaptive Control Strategies for Evolutionar...
Sort
View
GPEM
2008
128views more  GPEM 2008»
13 years 9 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
CP
2000
Springer
14 years 1 months ago
Boosting Search with Variable Elimination
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
Javier Larrosa
CEC
2010
IEEE
13 years 9 months ago
Sequential DE enhanced by neighborhood search for Large Scale Global Optimization
— In this paper, the performance of a sequential Differential Evolution (DE) enhanced by neighborhood search (SDENS) is reported on the set of benchmark functions provided for th...
Hui Wang, Zhijian Wu, Shahryar Rahnamayan, Dazhi J...
SIGMOD
2006
ACM
171views Database» more  SIGMOD 2006»
14 years 9 months ago
Communication-efficient distributed monitoring of thresholded counts
Monitoring is an issue of primary concern in current and next generation networked systems. For example, the objective of sensor networks is to monitor their surroundings for a va...
Ram Keralapura, Graham Cormode, Jeyashankher Ramam...
CP
2007
Springer
14 years 3 months ago
Constructive Interval Disjunction
Shaving and constructive disjunction are two main refutation principles used in constraint programming. The shaving principle allows us to compute the singleton arc-consistency (SA...
Gilles Trombettoni, Gilles Chabert