Re: Paramset Proposal

Kevin -
How does this look for a paramset resolution algorithm:

For each instance,
1. Find all paramsets for which
a) the parameters overridden on the instance are parameters of the paramset
b) the parameters of the paramset, with overrides and defaults, are all within the
allowed ranges
c) the localparams of the paramset, computed from parameters, are within the
allowed range
2. choose the paramset which has the fewest number of un-overridden parameters
3. choose the paramset with the greatest number of range limited localparams

Even with this algorithm, there is no assurance that the ambiguities of
the type given in the first case are eliminated. For example, an instance
with a parameter Alpha might be associated with two paramsets, the first
accepts instances with parameters Alpha and Beta, and the second with
parameters Alpha and Gamma. In this case, either paramset could be used.
However the ambiguity can be eliminated if desired by adding a third
paramset that accepts instances with only the parameter Alpha.

-Geoffrey
Received on Fri May 21 07:58:23 2004