Sciweavers

Share
GECCO
2007
Springer

Enhanced forma analysis of permutation problems

9 years 5 months ago
Enhanced forma analysis of permutation problems
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i.e., the basis), which is used to describe the search space. In the case of permutation problems, where the basis is highly constrained, the declarative nature of forma analysis encounters some difficulties which give rise to some additional issues, such as the interpretation of declarative constraints and the complexity of the application of operator. This paper aims to address these issues by introducing Enhanced Forma Analysis that explores a broader view of forma analysis by using ideas from constraint satisfaction. Categories and Subject Descriptors F.2.2 [Theory of Computation]: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY—Nonnumerical Algorithms and Problems General Terms Theory Keywords Forma analysis, constraint satisfaction, permutation problems
Tao Gong, Andrew Tuson
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where GECCO
Authors Tao Gong, Andrew Tuson
Comments (0)
books