K.Z. Gajos et al. / Artificial Intelligence 174 (2010) 910–950919
Table 1An algorithm combining branch-and-bound discrete optimization and constraint satisfaction mechanisms. The
variables correspond to the elements in the functional specification
Sf, their possible
values are drawn from
the set of available widgetsW, and the
constraints include both interface and device constraints (i.e.,
CIand
CD). The solution is stored in
bestRendition.
bestCost← ∞
bestRendition←
nullShare with your friends: