GNU Prolog is a general-purpose implementation of the Prolog language, which distinguishes itself from most other systems by being, above all else, a native-code compiler which produces stand-alone executables which do not rely on any bytecode emulator or meta-interpreter. Other aspects which stand out include the explicit organization of the Prolog system as a multipass compiler, where intermediate representat...
The Costas Array Problem is a highly combina- torial problem linked to radar applications. We present in this paper its detailed modeling and solving by Adaptive Search, a constraint-based local search method. Experiments have been done on both sequential and parallel hardware up to several hundreds of cores. Performance evaluation of the sequential version shows results outperforming previous implementations, ...
TheCostasArrayProblemisahighlycombinatorialproblem 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 hundreds of cores. Performance evaluation of the sequential version shows results outperforming previous implemen- tations, while ...
GNU Prolog is a general-purpose implementation of the Prolog language, which distinguishes itself from most other systems by being, above all else, a native-code compiler which produces stand-alone executables which do not rely on any bytecode emulator or meta-interpreter. Other aspects which stand out include the explicit organization of the Prolog system as a multipass compiler, where intermediate representat...
We investigated the use of the Cell Broadband Engine (Cell/BE) for constraint-based local search and combinatorial optimization applications. We presented a parallel version of a constraint-based local search algorithm that was chosen because it fits very well the Cell/BE architecture because it requires neither shared memory nor communication among processors. The performance study on several large optimizatio...
In this work we present NeMODe a declarative system for Computer Network Intrusion detection which provides a declarative Do- main Specific Language for describing computer network intrusion signa- tures that could spread across several network packets, which allows to state constraints over network packets, describing relations between sev- eral packets, and providing several back-end detection mechanisms whic...
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 sequential local search method for Constraint Satisfaction Problems. The implemented algorithm is a parallel version of adaptive...
We present a parallel implementation of a constraint-based local search algorithm and investigate its performance results on hardware with several hundreds of processors. We choose as basic constraint solving algorithm for these experiments the ”adaptive search” method, an efficient sequential local search method for Constraint Satisfaction Problems. The implemented algorithm is a parallel version of adaptive s...
We present a parallel implementation of a constraint-based local search algorithm and investigate its performance re- sults on hardware with several hundreds of processors.
Se muestra una experiencia desarrollada en el Instituto Superior Politécnico "José Antonio Echeverría", con estudiantes de la carrera de Ingeniería Automática. Se desarrolló por parte de los estudiantes un proyecto con características de asignatura integradora, donde tuvieron que ser capaces de afrontar una tarea con elementos recibidos a partir de un variado número de asignaturas, que según la experiencia de a...
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||