Sciweavers

Share
98 search results - page 1 / 20
» Solving the Weighted Constraint Satisfaction Problems Via th...
Sort
View
IJIMAI
2016
82views more  IJIMAI 2016»
4 years 6 months ago
Solving the Weighted Constraint Satisfaction Problems Via the Neural Network Approach
— A wide variety of real world optimization problems can be modelled as Weighted Constraint Satisfaction Problems (WCSPs). In this paper, we model this problem in terms of in ori...
Khalid Haddouch, Karim Elmoutaoukil, Mohamed Ettao...
PPSN
1998
Springer
10 years 2 months ago
Solving Binary Constraint Satisfaction Problems Using Evolutionary Algorithms with an Adaptive Fitness Function
This paper presents a comparative study of Evolutionary Algorithms (EAs) for Constraint Satisfaction Problems (CSPs). We focus on EAs where fitness is based on penalization of cons...
A. E. Eiben, Jano I. van Hemert, Elena Marchiori, ...
HIS
2004
10 years 2 days ago
Q'tron Neural Networks for Constraint Satisfaction
This paper proposes the methods to solve the constraint satisfaction problems (CSPs) using Q'tron neural networks (NNs). A Q'tron NN is local-minima free if it is built ...
Tai-Wen Yue, Mei-Ching Chen
GECCO
1999
Springer
158views Optimization» more  GECCO 1999»
10 years 3 months ago
Coevolutionary Genetic Algorithms for Solving Dynamic Constraint Satisfaction Problems
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...
Hisashi Handa, Osamu Katai, Tadataka Konishi, Mits...
IJCNN
2006
IEEE
10 years 4 months ago
Job-Shop Scheduling with an Adaptive Neural Network and Local Search Hybrid Approach
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
Shengxiang Yang
books