51 search results - page 4 / 11 » Boosting Search with Variable Elimination |
CP
2006
Springer
14 years 8 days ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
CP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
CONSTRAINTS
2006
13 years 8 months ago
2006
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
ICDM
2003
IEEE
14 years 1 months ago
2003
IEEE
Learning Bayesian network structure from large-scale data sets, without any expertspecified ordering of variables, remains a difficult problem. We propose systematic improvements ...
DATE
2008
IEEE
14 years 3 months ago
2008
IEEE
We present an efficient analog synthesis algorithm employing regression models of circuit matrices. Circuit matrix models achieve accurate and speedy synthesis of analog circuits...