NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 2 of 2 (0.058 seconds)

Spelling suggestions: "subject:"eigenproblem"" "subject:"kurdenproblem""

1

Putting Queens in Carry Chains

Preußer, Thomas B., Nägel , Bernd, Spallek, Rainer G. 14 November 2012 (has links) (PDF)
This paper describes an FPGA implementation of a solution-counting solver for the N-Queens Puzzle. The proposed algorithmic mapping utilizes the fast carrychain logic found on modern FPGA architectures in order to achieve a regular and efficient design. From an initial full chessboard mapping, several optimization strategies are explored. Also, the infrastructure is described, which we have constructed for the computation of the currently unknown solution count of the 26- Queens Puzzle. Finally, we compare the performance of our used concrete FPGA device mappings also in contrast to general-purpose CPUs.
Programmierung
Damenproblem
N-Queens Puzzle
FPGA implementation
FPGA device mapping
general-purpose CPUs
ddc:004
rvk:SS 5514
2

Putting Queens in Carry Chains

Preußer, Thomas B., Nägel, Bernd, Spallek, Rainer G. 14 November 2012 (has links)
This paper describes an FPGA implementation of a solution-counting solver for the N-Queens Puzzle. The proposed algorithmic mapping utilizes the fast carrychain logic found on modern FPGA architectures in order to achieve a regular and efficient design. From an initial full chessboard mapping, several optimization strategies are explored. Also, the infrastructure is described, which we have constructed for the computation of the currently unknown solution count of the 26- Queens Puzzle. Finally, we compare the performance of our used concrete FPGA device mappings also in contrast to general-purpose CPUs.
Programmierung, Damenproblem
info:eu-repo/classification/ddc/004
ddc:004

Page generated in 0.062 seconds