261 search results - page 30 / 53 » On Threshold BDDs and the Optimal Variable Ordering Problem |
CERA
2002
13 years 7 months ago
2002
: A shape design sensitivity analysis and optimization procedure is proposed using a meshfree method. A CAD tool connection is established to facilitate the seamless integration of...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
TOMACS
2002
13 years 7 months ago
2002
Consider the problem of estimating the small probability that the maximum of a random walk exceeds a large threshold, when the process has a negative drift and the underlying rand...
AI
2008
Springer
13 years 7 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
LPAR
2005
Springer
14 years 1 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...