Results 1 - 10 of 25,012

Memoisation for constraint-based local search

by unknown authors
"... Abstract. We present a memoisation technique for constraint-based local search based on the observation that penalties with respect to some interchangeable elements need only be calculated once. We apply the technique to constraint-based local search on set variables, and demonstrate the usefulness ..."
Abstract - Add to MetaCart
Abstract. We present a memoisation technique for constraint-based local search based on the observation that penalties with respect to some interchangeable elements need only be calculated once. We apply the technique to constraint-based local search on set variables, and demonstrate the usefulness

Distributed Constraint-Based Local Search

by Laurent Michel, Andrew See, Pascal Van Hentenryck
"... Abstract. Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed but instead a doubling of the number of cores. Unfortunately, it also places significant conceptual and implem ..."
Abstract - Cited by 8 (1 self) - Add to MetaCart
and implementation burden on programmers. This paper aims at addressing this challenge for constraint-based local search (CBLS), whose search procedures typically exhibit inherent parallelism stemming from multistart, restart, or population-based techniques whose benefits have been demonstrated both experimentally

Constraint-Based Local Search for the Costas Array Problem

by Daniel Diaz, Florian Richoux, Yves Caniou, Salvador Abreu - proceedings of LION6, 6th Learning and Intelligent OptimizatioN Conference
"... Abstract The Costas Array Problem is a highly combinatorial problem linked to radar applications. We present in this paper its detailed mod-eling and solving by Adaptive Search, a constraint-based local search method. Experiments have been done on both sequential and parallel hardware up to several ..."
Abstract - Cited by 6 (4 self) - Add to MetaCart
Abstract The Costas Array Problem is a highly combinatorial problem linked to radar applications. We present in this paper its detailed mod-eling and solving by Adaptive Search, a constraint-based local search method. Experiments have been done on both sequential and parallel hardware up to several

Performance analysis of parallel constraint-based local search

by Yves Caniou, Daniel Diaz, Florian Richoux, Salvador Abreu - in PPoPP 2012, 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
"... We present a parallel implementation of a constraint-based local search algorithm and investigate its performance results for hard combinatorial optimization problems on two different platforms up to several hundreds of cores. On a variety of classical CSPs bench-marks, speedups are very good for a ..."
Abstract - Cited by 4 (3 self) - Add to MetaCart
We present a parallel implementation of a constraint-based local search algorithm and investigate its performance results for hard combinatorial optimization problems on two different platforms up to several hundreds of cores. On a variety of classical CSPs bench-marks, speedups are very good for a

Experiments in parallel constraint-based local search

by Yves Caniou, Daniel Diaz, Salvador Abreu - Evolutionary Computation in Combinatorial Optimization - 11th European Conference, EvoCOP 2011
"... Abstract. We present a parallel implementation of a constraint-based local search algorithm and investigate its performance results on hard-ware with several hundreds of processors. We choose as basic constraint solving algorithm for these experiments the ”adaptive search ” method, an efficient sequ ..."
Abstract - Cited by 13 (11 self) - Add to MetaCart
Abstract. We present a parallel implementation of a constraint-based local search algorithm and investigate its performance results on hard-ware with several hundreds of processors. We choose as basic constraint solving algorithm for these experiments the ”adaptive search ” method, an efficient

Model-Driven Visualizations of Constraint-Based Local Search

by Grégoire Dooms, Pascal Van Hentenryck, Laurent Michel
"... Abstract. Visualization is often invaluable to understand the behavior of optimization algorithms, identify their bottlenecks or pathological behaviors, and suggest remedial techniques. Yet developing visualizations is often a tedious activity requiring significant time and expertise. This paper pre ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
presents a framework for the visualization of constraint-based local search (CBLS) algorithms. Given a high-level model and a declarative visualization specification, the CBLS visualizer systematically produces animations to visualize constraints and objectives, violations, and conflicts, as well

Parallel constraint-based local search on the cell/be multicore architecture

by Danny Munera, Daniel Diaz, Salvador Abreu - In proceedings of IDC2010, Intelligent Distributed Computing IV , 2010
"... Abstract. In this study, we started to investigate how the Partitioned Global Address Space (PGAS) programming language X10 would suit the implementation of a Constraint-Based Local Search solver. We wanted to code in this language because we expect to gain from its ease of use and independence from ..."
Abstract - Cited by 7 (5 self) - Add to MetaCart
Abstract. In this study, we started to investigate how the Partitioned Global Address Space (PGAS) programming language X10 would suit the implementation of a Constraint-Based Local Search solver. We wanted to code in this language because we expect to gain from its ease of use and independence

Water Retention on Magic Squares with Constraint-Based Local Search

by Johan Öfverstedt, Johan Öfverstedt
"... Water Retention on Magic Squares is the hard combinatorial optimisation problem of searching for magic squares with a maximum amount of water retained by their structure when viewed as a heightmap. Constraint-Based Local Search, which is a non-exhaustive search technique for problems with constraint ..."
Abstract - Add to MetaCart
Water Retention on Magic Squares is the hard combinatorial optimisation problem of searching for magic squares with a maximum amount of water retained by their structure when viewed as a heightmap. Constraint-Based Local Search, which is a non-exhaustive search technique for problems

Synthesis of constraint-based local search algorithms from high-level models

by Pascal Van Hentenryck, Laurent Michel - IN: AAAI , 2007
"... The gap in automation between MIP/SAT solvers and those for constraint programming and constraint-based local search hinders experimentation and adoption of these technologies and slows down scientific progress. This paper addresses this important issue: It shows how effective local search pro-cedur ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
The gap in automation between MIP/SAT solvers and those for constraint programming and constraint-based local search hinders experimentation and adoption of these technologies and slows down scientific progress. This paper addresses this important issue: It shows how effective local search pro

A GPU Implementation of Parallel Constraint-based Local Search

by Alejandro Arbelaez, et al.
"... In this paper we study the performance of constraint-based local search solvers on a GPU. The massively parallel architecture of the GPU makes it possible to explore parallelism at two different levels inside the local search algorithm. First, by executing multiple copies of the algorithm in a multi ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
In this paper we study the performance of constraint-based local search solvers on a GPU. The massively parallel architecture of the GPU makes it possible to explore parallelism at two different levels inside the local search algorithm. First, by executing multiple copies of the algorithm in a
Results 1 - 10 of 25,012