When genetic programming (GP) is used to find programs with Boolean inputs and outputs, ordered binary decision diagrams (OBDDs) are often used successfully. In all known OBDD-based GP-systems the variable ordering, a crucial factor for the size of OBDDs, is preset to an optimal ordering of the known test function. Certainly this cannot be done in practical applications, where the function to l...

When genetic programming (GP) is used to find programs with Boolean inputs and outputs, ordered binary decision diagrams (OBDDs) are often used successfully. In all known OBDD-based GP-systems the variable ordering, a crucial factor for the size of OBDDs, is preset to an optimal ordering of the known test function. Certainly this cannot be done in practical applications, where the function to l...

‎The most challenging task in dealing with Bayesian networks is learning their structure‎. ‎Two classical approaches are often used for learning Bayesian network structure;‎ ‎Constraint-Based method and Score-and-Search-Based one‎. ‎But neither the first nor the second one are completely satisfactory‎. ‎Therefore the heuristic search such as Genetic Alg...

Design of Experiments in BDD Variable Ordering: Lessons Learned Justin E. Harlow III1 Franc Brglez2 1Dept. of Electrical & Computer Engineering, Duke University, Durham, NC 27708 2CBL (Collaborative Benchmarking Lab), Dept. of Comp. Science, Box 7550, NC State U., Raleigh, NC 27695 http://www.cbl.ncsu.edu/ Abstract { Applying the Design of Experiments methodology to the evaluation of BDD variab...

One of the key factors in the eeciency of backtracking algorithms is the rule they use to decide on which variable to branch next (namely, the variable ordering heuristics). In this paper, we give a formulation of dynamic variable ordering heuristics that takes into account the properties of the neighborhood of the variable.

Weighted Constraint Satisfaction Problems (WCSP) are used to model and to solve some constraint optimization problems. WCSPs are often solved by complete or partial tree search strategies combined with filtering. For these methods, variable ordering heuristic (MinDom/FutDeg) and value ordering heuristic (MinAC) are considered to be the most efficient ones. In this paper, we propose a new value ...

(Abstract) Recently, an efficient method of database analysis using Zero-suppressed Binary Decision Diagrams (ZBDDs) has been proposed. BDDs are a graph-based representation of Boolean functions, now widely used in system design and verification. Here we focus on ZBDDs, a special type of BDDs, which are suitable for handling large-scale combinatorial itemsets in frequent item-set mining. In gen...

We investigate techniques to discover and exploit problem structure in the form of interchangeability. We enhance the performance of backtrack search with forward-checking (FC-BT) for finding all solutions to a finite Constraint Satisfaction Problem(CSP) with dynamic interchangeability detection and dynamic variable ordering. We evaluate these strategies both theoretically and empirically.

The catalytic properties of mixed oxides with the fluorite or pyrochlore structure were investigated using CO oxidation. The presence of ions with a variable valence state, the size of the ions and especially the extent of pyrochlore ordering affect kinetic behaviour and activity of the investigated materials.

Knowledge compilation structures such as MDDs have been proposed as a way to compile CSPs, to make requests tractable online, in cases where solving is not possible. This paper studies the interest in relaxing two assumptions usually imposed on MDDs, static ordering and read-once property, using a new compilation structure called Set-labeled Diagrams, which are compiled by tracing the search tr...