Sciweavers

4488 search results - page 319 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
IEAAIE
1998
Springer
15 years 9 months ago
Generating Heuristics to Control Configuration Processes
Abstract. Configuration is the process of composing a system from a set of components such that the system fulfills a set of desired demands. The configuration process relies on a ...
Benno Stein
CEC
2011
IEEE
14 years 4 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
GECCO
2005
Springer
141views Optimization» more  GECCO 2005»
15 years 10 months ago
Behavior of finite population variable length genetic algorithms under random selection
In this work we provide empirical evidence that shows how a variable-length genetic algorithm (GA) can naturally evolve shorter average size populations. This reduction in chromos...
Hal Stringer, Annie S. Wu
CP
2004
Springer
15 years 8 months ago
Full Dynamic Substitutability by SAT Encoding
Symmetry in constraint problems can be exploited to greatly improve search performance. A form of symmetry that has been the subject of considerable research is value interchangeab...
Steven David Prestwich
WSDM
2010
ACM
197views Data Mining» more  WSDM 2010»
15 years 11 months ago
Beyond DCG: user behavior as a predictor of a successful search
Web search engines are traditionally evaluated in terms of the relevance of web pages to individual queries. However, relevance of web pages does not tell the complete picture, si...
Ahmed Hassan, Rosie Jones, Kristina Lisa Klinkner