380 search results - page 32 / 76 » Mapping Problems with Finite-Domain Variables into Problems ... |
103
click to vote
CCECE
2006
IEEE
15 years 5 months ago
2006
IEEE
Several approaches have been proposed to accelerate the NP-complete Boolean Satisfiability problem (SAT) using reconfigurable computing. We present an FPGA based clause evaluator,...
ISCAS
2002
IEEE
15 years 4 months ago
2002
IEEE
We address the problem of checking the routability of segmented channels using satisfiability. The segmented channel routing problem arises in the context of row-based field progr...
102
click to vote
CONSTRAINTS
2010
14 years 9 months ago
2010
MiniZinc arose as a response to the extended discussion at CP2006 of the need for a standard modelling language for CP. This is a challenging problem, and we believe MiniZinc makes...
ICSE
2008
IEEE-ACM
15 years 12 months ago
2008
IEEE-ACM
Variability modelling with feature models is one key technique for specifying the problem space of Software Product Lines (SPLs). To allow for the automatic derivation of a concre...
AAAI
2006
15 years 1 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...