A Bayesian network-based framework with Constraint Satisfaction Problem (CSP) formulations for FPGA system design.
Amelia W. AzmanAbbas BigdeliYasir Mohd-MustafahMorteza Biglari-AbhariBrian C. LovellPublished in: ASAP (2010)
Keyphrases
- constraint satisfaction problems
- partial constraint satisfaction
- constraint satisfaction
- constraint propagation
- constraint programming
- arc consistency
- search space
- decomposition methods
- combinatorial problems
- constraint solving
- constraint networks
- np complete
- np hard
- non binary
- temporal constraints
- tree decompositions
- hard constraints
- forward checking
- constraint graph
- tractable classes