Sökning: "Breadth-first Search"

Visar resultat 11 - 12 av 12 uppsatser innehållade orden Breadth-first Search.

1. 11. Evaluation of the Configurable Architecture REPLICA with Emulated Shared Memory

   Master-uppsats, Programvara och system; Tekniska högskolan

   Författare :Erik Alnervik; [2014]
   Nyckelord :REPLICA; PRAM; CRCW; Benchmark; Benchmarking; Parallel Computing; Manycore; REPLICA; PRAM; CRCW; benchmark; benchmarking; Parallell Programmering;

   Sammanfattning : REPLICA is a family of novel scalable chip multiprocessors with configurable emulated shared memory architecture, whose computation model is based on the PRAM (Parallel Random Access Machine) model. The purpose of this thesis is to, by benchmarking different types of computation problems on REPLICA, similar parallel architectures (SB-PRAM and XMT) and more diverse ones (Xeon X5660 and Tesla M2050), evaluate how REPLICA is positioned among other existing architectures, both in performance and programming effort. LÄS MER

3. 12. A comparison of SL- and unit-resolution search rules for stratified logic programs

   Kandidat-uppsats, TCSLAB - Laboratoriet för teoretisk datalogi

   Författare :Victor Lagerqvist; [2010]
   Nyckelord :logic programming; search rule; resolution; prolog; heuristic search;

   Sammanfattning : There are two symmetrical resolution rules applicable to logic programs - SL-resolution which yields a top-down refutation and unit-resolution which yields a bottom-up refutation. Both resolution principles need to be coupled with a search rule before they can be used in practice. LÄS MER