Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Lisp and Symbolic Computation
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Constraint programming for combinatorial search problems
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
The GNU Prolog system and its implementation
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
How to solve it: modern heuristics
How to solve it: modern heuristics
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Tabu Search
Constraints
A Constraint Programming Framework for Local Search Methods
Journal of Heuristics
Localizer++: An Open Library for local Search
Localizer++: An Open Library for local Search
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Integer optimization by local search: a domain-independent approach
Integer optimization by local search: a domain-independent approach
A constraint-based architecture for local search
OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Intelligent Agents in Virtual Worlds
ADVIS '02 Proceedings of the Second International Conference on Advances in Information Systems
Maintaining Longest Paths Incrementally
Constraints
Contraint-Based Combinators for Local Search
Constraints
A DSL for intrusion detection based on constraint programming
Proceedings of the 3rd international conference on Security of information and networks
Using constraints for intrusion detection: the NeMODe system
PADL'11 Proceedings of the 13th international conference on Practical aspects of declarative languages
Constraint programming systems for modeling music theories and composition
ACM Computing Surveys (CSUR)
Parallel constraint-based local search on the HA8000 supercomputer (abstract)
Proceedings of the 2011 ACM Symposium on Applied Computing
Experiments in parallel constraint-based local search
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Network monitoring with constraint programming: preliminary specification and analysis
INAP'09 Proceedings of the 18th international conference on Applications of declarative programming and knowledge management
Set variables and local search
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Performance analysis of parallel constraint-based local search
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
A local search system for solving constraint problems of declarative graph-based global constraints
INAP'04/WLP'04 Proceedings of the 15th international conference on Applications of Declarative Programming and Knowledge Management, and 18th international conference on Workshop on Logic Programming
Targeting the Cell Broadband Engine for constraint-based local search
Concurrency and Computation: Practice & Experience
An exploration-exploitation compromise-based adaptive operator selection for local search
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Constraint-based local search for the costas array problem
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Modelling distributed network attacks with constraints
International Journal of Bio-Inspired Computation
| Hi-index | 0.00 |
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advantage of the structure of the problem in terms of constraints and variables and can guide the search more precisely than a global cost function to optimize (such as for instance the number of violated constraints). We also use an adaptive memory in the spirit of Tabu Search in order to prevent stagnation in local minima and loops. This method is generic, can apply to a large class of constraints (e.g. linear and non-linear arithmetic constraints, symbolic constraints, etc) and naturally copes with over-constrained problems. Preliminary results on some classical CSP problems show very encouraging performances.