ALPS is a framework for implementing and parallelizing tree search algorithms. It employs a number of features to improve scalability and is designed specifically to support the implementation of data intensive algorithms, in which large amounts of knowledge are generated and must be maintained and shared during the search. Implementing such algorithms in a scalable manner is challenging both because of storage requirements and because of communications overhead incurred in the sharing of data. In this abstract, we describe the design of ALPS and how the design addresses these challenges. We present two sample applications built with ALPS and preliminary computational results.
International audienceConstraint-Based Local Search (CBLS) consist in using Local Search methods [4]...
Heuristic search is a fundamental technique for solving problems in artificial intelligence. However...
International audienceIn the context of exascale programming, we investigate a parallel distributed ...
This report describes the design of the Abstract Library for Parallel Search (ALPS), a framework for...
International audienceParallel tree search algorithms offer viable solutions to problems in differen...
We describe mts, a generic framework for parallelizing certain types of tree search programmes inclu...
Combinatorial search problems in mathematics, e.g. in finite geometry, are notoriously hard; a state...
Combinatorial search is central to many applications, yet the huge irregular search trees and the ne...
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...
International audienceConstraint satisfaction and combinatorial optimization problems , even when mo...
With the recent arrival of the exascale era, modern supercomputers are increasingly big making their...
The search for solutions in a combinatorially large problem space is a major problem in artificial i...
International audienceTree-based search algorithms applied to combinatorial optimization problems ar...
International audienceIn this work, we show that the Chapel high-productivity language is suitable f...
International audienceConstraint-Based Local Search (CBLS) consist in using Local Search methods [4]...
Heuristic search is a fundamental technique for solving problems in artificial intelligence. However...
International audienceIn the context of exascale programming, we investigate a parallel distributed ...
This report describes the design of the Abstract Library for Parallel Search (ALPS), a framework for...
International audienceParallel tree search algorithms offer viable solutions to problems in differen...
We describe mts, a generic framework for parallelizing certain types of tree search programmes inclu...
Combinatorial search problems in mathematics, e.g. in finite geometry, are notoriously hard; a state...
Combinatorial search is central to many applications, yet the huge irregular search trees and the ne...
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...
International audienceConstraint satisfaction and combinatorial optimization problems , even when mo...
With the recent arrival of the exascale era, modern supercomputers are increasingly big making their...
The search for solutions in a combinatorially large problem space is a major problem in artificial i...
International audienceTree-based search algorithms applied to combinatorial optimization problems ar...
International audienceIn this work, we show that the Chapel high-productivity language is suitable f...
International audienceConstraint-Based Local Search (CBLS) consist in using Local Search methods [4]...
Heuristic search is a fundamental technique for solving problems in artificial intelligence. However...
International audienceIn the context of exascale programming, we investigate a parallel distributed ...