Hi, all!
While building a best-search example for Mostafa, I developed a
best-search method that looks like the one that uses distribution on the
cost variable, but does that by iteratively halving its domain. It's
actually a hybrid of Search.one- and Search.best-based best-search methods
and is sure not to try more than log2({FD.reflect.size CostVar}) values.
As I've never heard of something like that (but I am no CP expert), I am
sending it to you all as a curiosity. It may as well be worthless :o)Cheers, Jorge
BestSearch.oz
Description: Binary data
_________________________________________________________________________________ mozart-users mailing list [email protected] http://www.mozart-oz.org/mailman/listinfo/mozart-users
