International audienceIn this study, we have investigated the adequacy of the PGAS parallel language X10 to implement a Constraint-Based Local Search solver. We decided to code in this language to bene fit from the ease of use and architectural independence from parallel resources which it o ffers. We present the implementation strategy, in search of di fferent sources of parallelism in the context of an implementation of the Adaptive Search algorithm. We extensively discuss the algorithm and its implementation. The performance evaluation on a representative set of benchmarks shows close to linear speed-ups, in all the problems treated
Abstract. Local search is a successful approach for solving combina-torial optimization and constrai...
Abstract We present a parallel implementation of a constraint-based local search algorithm and inves...
Abstract Constraint-Based Local Search (CBLS) consist in using Local Search methods [4] for solving...
International audienceIn this study, we started to investigate how the Partitioned Global Address Sp...
Abstract. In this study, we have investigated the adequacy of the PGAS parallel language X10 to impl...
We present a parallel implementation of a constraint-based local search algorithm and investigate it...
We present a parallel implementation of a constraint-based local search algorithm and investigate it...
International audienceWe present the parallel implementation of a constraint-based Local Search algo...
We present a parallel implementation of a constraint-based local search algorithm and investigate it...
Abstract In this paper we address the problem of parallelizing local search. We propose a general f...
International audienceIn this paper we address the problem of parallelizing local search. We propose...
Abstract. In this study, we started to investigate how the Partitioned Global Address Space (PGAS) p...
Constraint satisfaction and combinatorial optimization problems, even when modeled with efficient m...
Abstract. Local search is a successful approach for solving combina-torial optimization and constrai...
Abstract. Local search is a successful approach for solving combina-torial optimization and constrai...
Abstract We present a parallel implementation of a constraint-based local search algorithm and inves...
Abstract Constraint-Based Local Search (CBLS) consist in using Local Search methods [4] for solving...
International audienceIn this study, we started to investigate how the Partitioned Global Address Sp...
Abstract. In this study, we have investigated the adequacy of the PGAS parallel language X10 to impl...
We present a parallel implementation of a constraint-based local search algorithm and investigate it...
We present a parallel implementation of a constraint-based local search algorithm and investigate it...
International audienceWe present the parallel implementation of a constraint-based Local Search algo...
We present a parallel implementation of a constraint-based local search algorithm and investigate it...
Abstract In this paper we address the problem of parallelizing local search. We propose a general f...
International audienceIn this paper we address the problem of parallelizing local search. We propose...
Abstract. In this study, we started to investigate how the Partitioned Global Address Space (PGAS) p...
Constraint satisfaction and combinatorial optimization problems, even when modeled with efficient m...
Abstract. Local search is a successful approach for solving combina-torial optimization and constrai...
Abstract. Local search is a successful approach for solving combina-torial optimization and constrai...
Abstract We present a parallel implementation of a constraint-based local search algorithm and inves...
Abstract Constraint-Based Local Search (CBLS) consist in using Local Search methods [4] for solving...
Add to ORKG