Lines Matching refs:with
6 % in compliance with the License. You may obtain a copy of the License
23 \chapter{Getting started with Finite Domains}
65 \item Create the variables with their initial domains
72 The idea is to associate a digit (0-9) with each letter so the
83 % Assign a finite domain with each letter - S, E, N, D, M, O, R, Y -
106 to define that some colours fit with each other and others do
112 fit with each other:
127 can be defined in ECLiPSe. They are different solutions with different
250 with all currently imposed constraints.
279 schedule tasks with their earliest possible starting time.
292 These predicates support optimization in conjunction with all the
306 is recorded and the search is continued or restarted with an
394 To represent a bin, with its colour, capacity and contents we use
418 the same, but with the bins in a different order).
432 is awkward to model the problem with a fixed set of variables.
437 each one with a - larger - fixed number of bins,
440 The predicate {\bf bin_setup/2} to generate a list of bins with appropriate
442 First it tries to match the (remaining) demand with zero,
626 (Another way to associate integers with colours is