Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Idea: precompute value distributions #88

Open
pvdz opened this issue Jun 29, 2016 · 0 comments
Open

Idea: precompute value distributions #88

pvdz opened this issue Jun 29, 2016 · 0 comments

Comments

@pvdz
Copy link
Contributor

pvdz commented Jun 29, 2016

Right now the value distributors are applied during runtime and every step in the search tree has to figure out the next value over and over again. This is simple for min and max, of course, but less so for others.

What if we could somehow precompute the order of resolving?

Sounds good but it's not that trivial;

  • You would need to extrapolate all the numbers in the domain to order them properly
    • Expanding the domain to a list of numbers can result in a huge set for domains like [0, SUP] or anything like that.
  • Unless you want to copy and reduce this list on every step (which is infeasible for memory reasons) you'd still need to search for the next valid value of the precomputed list that is still part of the domain at the current step. That's not likely to be any faster.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant