Sciweavers

39 search results - page 4 / 8
» Light Algorithms for Maintaining Max-RPC During Search
Sort
View
CPAIOR
2007
Springer
14 years 1 months ago
YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
Wafa Karoui, Marie-José Huguet, Pierre Lope...
EMO
2009
Springer
219views Optimization» more  EMO 2009»
14 years 2 months ago
An Elitist GRASP Metaheuristic for the Multi-objective Quadratic Assignment Problem
We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objecti...
Hui Li, Dario Landa Silva
CEC
2009
IEEE
14 years 7 days ago
Performance of infeasibility driven evolutionary algorithm (IDEA) on constrained dynamic single objective optimization problems
Abstract—A number of population based optimization algorithms have been proposed in recent years to solve unconstrained and constrained single and multi-objective optimization pr...
Hemant K. Singh, Amitay Isaacs, Trung Thanh Nguyen...
JAIR
2011
124views more  JAIR 2011»
13 years 2 months ago
Second-Order Consistencies
In this paper, we propose a comprehensive study of second-order consistencies (i.e., consistencies identifying inconsistent pairs of values) for constraint satisfaction. We build ...
Christophe Lecoutre, Stéphane Cardon, Julie...
PRICAI
1998
Springer
13 years 11 months ago
Dynamic Constraint Weighting for Over-Constrained Problems
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
John Thornton, Abdul Sattar