Amanote Research

Amanote Research

  • Register
  • Sign In

Solving Satisfiability Problems Using Reconfigurable Computing

IEEE Transactions on Very Large Scale Integration (VLSI) Systems- United States

doi 10.1109/92.920826

Full Text

Abstract

Available in

Categories

HardwareElectronic EngineeringElectricalArchitectureSoftware

Date

February 1, 2001

Authors

T. SuyamaM. YokooH. SawadaA. Nagoya

Publisher

Institute of Electrical and Electronics Engineers (IEEE)


Related search

Computing All Optimal Solutions in Satisfiability Problems With Preferences

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

High-Performance Computing Using a Reconfigurable Accelerator

Concurrency: Practice and Experience
1996English

Bit-Precise Formal Verification for SystemC Using Satisfiability Modulo Theories Solving

IFIP Advances in Information and Communication Technology
Computer NetworksInformation SystemsManagementCommunications
2017English

Reconfigurable Computing Application Frameworks

2003English

Solving Architectural Modelling Problems Using Knowledge

English

Solving Satisfiability in Fuzzy Logics by Mixing CMA-ES

2013English

Using Reconfigurable Computing Technology to Accelerate Matrix Decomposition and Applications

English

Combining Linear Programming and Satisfiability Solving for Resource Planning

Knowledge Engineering Review
Artificial IntelligenceSoftware
2001English

Introduction to Stochastic Computing Using a Remote Lab With Reconfigurable Logic

International Journal of Online Engineering
EngineeringE-learning
2016English

Amanote Research

Note-taking for researchers

Follow Amanote


© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy