lotten / daoopt Goto Github PK

Search::heuristicOR() should fetch heuristic values for all possible value assignments at once. Needs appropriate method in Heuristic class.

Edit: Applies equally to retrieving non-heuristic function values within Search::heuristicOR()

If a node is cachable but its variable a leaf in the pseudo tree, should it be cached?

Perform analysis to decide.

Search maintains the "correct" cost value but returns an incorrect assignment (i.e. assignment has different cost). Tuple updates during propagation likely incorrect.

Notes:

• propagate tuples only for nodes with non-zero value?

Examples:
-f pedigree23.uai --seed 12345 -i8
-f pedigree1.uai --seed 1811

In certain cases enabling --local in parallel static mode causes assignments with suboptimal solution costs to be returned.

Use vector<Function*> instead of the current linked list for efficiency reasons.