The Experts below are selected from a list of 6489 Experts worldwide ranked by ideXlab platform
Philip Laird - One of the best experts on this subject based on the ideXlab platform.
-
minimizing conflicts a heuristic repair method for constraint satisfaction and scheduling problems
1992Co-Authors: Steven Minton, Mark D Johnston, Andrew B Philips, Philip LairdAbstract:Abstract The paper describes a simple heuristic approach to solving large-scale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value-ordering heuristic, the min-conflicts heuristic , that attempts to minimize the number of constraint violations after each step. The heuristic can be used with a variety of different search strategies. We demonstrate empirically that on the n -queens problem, a technique based on this approach performs orders of magnitude better than traditional backtracking techniques. We also describe a scheduling application where the approach has been used successfully. A theoretical analysis is presented both to explain why this method works well on certain types of problems and to predict when it is likely to be most effective.
Steven Minton - One of the best experts on this subject based on the ideXlab platform.
-
minimizing conflicts a heuristic repair method for constraint satisfaction and scheduling problems
1992Co-Authors: Steven Minton, Mark D Johnston, Andrew B Philips, Philip LairdAbstract:Abstract The paper describes a simple heuristic approach to solving large-scale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value-ordering heuristic, the min-conflicts heuristic , that attempts to minimize the number of constraint violations after each step. The heuristic can be used with a variety of different search strategies. We demonstrate empirically that on the n -queens problem, a technique based on this approach performs orders of magnitude better than traditional backtracking techniques. We also describe a scheduling application where the approach has been used successfully. A theoretical analysis is presented both to explain why this method works well on certain types of problems and to predict when it is likely to be most effective.
Mark D Johnston - One of the best experts on this subject based on the ideXlab platform.
-
minimizing conflicts a heuristic repair method for constraint satisfaction and scheduling problems
1992Co-Authors: Steven Minton, Mark D Johnston, Andrew B Philips, Philip LairdAbstract:Abstract The paper describes a simple heuristic approach to solving large-scale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value-ordering heuristic, the min-conflicts heuristic , that attempts to minimize the number of constraint violations after each step. The heuristic can be used with a variety of different search strategies. We demonstrate empirically that on the n -queens problem, a technique based on this approach performs orders of magnitude better than traditional backtracking techniques. We also describe a scheduling application where the approach has been used successfully. A theoretical analysis is presented both to explain why this method works well on certain types of problems and to predict when it is likely to be most effective.
Andrew B Philips - One of the best experts on this subject based on the ideXlab platform.
-
minimizing conflicts a heuristic repair method for constraint satisfaction and scheduling problems
1992Co-Authors: Steven Minton, Mark D Johnston, Andrew B Philips, Philip LairdAbstract:Abstract The paper describes a simple heuristic approach to solving large-scale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value-ordering heuristic, the min-conflicts heuristic , that attempts to minimize the number of constraint violations after each step. The heuristic can be used with a variety of different search strategies. We demonstrate empirically that on the n -queens problem, a technique based on this approach performs orders of magnitude better than traditional backtracking techniques. We also describe a scheduling application where the approach has been used successfully. A theoretical analysis is presented both to explain why this method works well on certain types of problems and to predict when it is likely to be most effective.
Felix Winter - One of the best experts on this subject based on the ideXlab platform.
-
a hybrid approach for the sudoku problem using constraint programming in iterated local search
2017Co-Authors: Nysret Musliu, Felix WinterAbstract:Sudoku is not only a popular puzzle but also an interesting and challenging constraint satisfaction problem. Therefore, automatic solving methods have been the subject of several publications in the past two decades. Although current methods provide good solutions for small-sized puzzles, larger instances remain challenging. This article introduces a new local search technique based on the min-conflicts heuristic for Sudoku. Furthermore, the authors propose an innovative hybrid search technique that exploits constraint programming as a perturbation technique within the iterated local search framework. They experimentally evaluate their methods on challenging benchmarks for Sudoku and report improvements over state-of-the-art solutions. To show the generalizability of the proposed approach, they also applied their method on another challenging scheduling problem. The results show that the proposed method is also robust in another problem domain.