Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Volume 6, Issue 4October 2001
Publisher:
  • Kluwer Academic Publishers
  • 101 Philip Drive Assinippi Park Norwell, MA
  • United States
ISSN:1383-7133
Reflects downloads up to 20 Feb 2025Bibliometrics
Skip Table Of Content Section
article
A Context for Constraint Satisfaction Problem Formulation Selection

Much research effort has been applied to finding effective ways for solving constraint satisfaction problems. However, the most fundamental aspect of constraint satisfaction problem solving, problem formulation, has received much less attention. This is ...

article
Random Constraint Satisfaction: A More Accurate Picture

In the last few years there has been a great amount of interest in Random Constraint Satisfaction Problems, both from an experimental and a theoretical point of view. Quite intriguingly, experimental results with various models for generating random CSP ...

article
Random Constraint Satisfaction: Flaws and Structure

A recent theoretical result by Achlioptas et al. shows that many models of random binary constraint satisfaction problems become trivially insoluble as problem size increases. This insolubility is partly due to the presence of ‘flawed variables,’ ...

article
Guided Genetic Algorithm and its Application to Radio Link Frequency Assignment Problems

The Guided Genetic Algorithm (GCA) is a hybrid of Genetic Algorithm and Guided Local Search, a meta-heuristic search algorithm. As the search progresses, GGA modifies both the fitness function and fitness template of candidate solutions based on ...

article
Keep-Best Reproduction: A Local Family Competition Selection Strategy and the Environment it Flourishes in

This paper presents a comparison of two genetic algorithms (GAs) for constrained ordering problems. The first GA uses the standard selection strategy of roulette wheel selection and generational replacement (STDS), while the second GA uses an ...

Comments