Abstract
Analysis of different combinatorial search algorithms has shown that they have a set of distinctive features in common. The paper suggests a number of reusable blocks that support these features and provide high-level design of combinatorial accelerators. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
APA
Sklyarov, V., Skliarova, I., Almeida, P., & Almeida, M. (2003). High-level design tools for FPGA-based combinatorial accelerators. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2778, 976–979. https://doi.org/10.1007/978-3-540-45234-8_99
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free