721 search results - page 16 / 145 » On Generators of Random Quasigroup Problems |
CP
1997
Springer
14 years 2 days ago
1997
Springer
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 intrigu...
SCAI
2008
13 years 9 months ago
2008
The problem of automatically selecting simulation models for autonomous agents depending on their current intentions and beliefs is considered in this paper. The intended use of t...
TAINN
2005
Springer
14 years 1 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
CEC
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper proposes a genetic algorithm (GA) with random immigrants for dynamic optimization problems where the worst individual and its neighbours are replaced every generation. I...
WEA
2004
Springer
14 years 1 months ago
2004
Springer
This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are p...