Search
Skip to Search Results
Filter
Author / Creator / Contributor
Subject / Keyword
- 1Computer algorithms.
- 1Constraint satisfaction problem models
- 1Constraints (Artificial intelligence)
- 1Genetic Algorithms
- 1Implicit Parallelism
- 1Population Size
Year
Collections
Languages
Departments
-
2004
Technical report TR04-13. Existing random models for the constraint satisfaction problem (CSP) all require an extremely low constraint tightness in order to have non-trivial threshold behaviors and guaranteed hard instances at the threshold. We study the possibility of designing random CSP models...
-
Lower Bounds on the Population Size in Genetic Algorithms and Implicit Parallelism Revisited
Download2002
Technical report TR02-20. Determining an appropriate population size is very important in genetic algorithms and is closely related to the principle of implicit parallelism. In this paper, the problem of sizing the population is formulated as that of minimization of sampling errors. Two sampling...
1 - 3 of 3