Hi All,
I'm wondering if anyone can tell me the relative performance impact of
queries. Is it just the cost of matching facts against them ( regular
caching rules apply etc.)?
Thanks,
Dave
___
rules-users mailing list
rules-users@lists.jboss.org
h
Tabu search (and other local search algorithms such as simulated
annealing) are very good at a) find an optimal solution.
Unfortunately, it can't handle b) get the total number of solutions.
I 'd recommend a brute force or better yet a branch-and-bound (with alfa
and beta pruning) algorithm for
hi
you could use a solution taboo, on all solutions found so far and let the
solver solve again.
the problem is that you never know when to stop this algorithm.
that is, when you found the last valid solution.
but you could stop the solver after a certain amount of time and
decide that you have a
