Searched refs:bins (Results 1 - 7 of 7) sorted by relevance

/barrelfish-2018-10-04/usr/eclipseclp/CPViz/viz/src/ie/ucc/cccc/viz/
H A DVisualizerBinPacking.java30 * sizes (integers) and bins (dvars)
44 Pair[] bins = visualState.argumentMinMaxArray("bins");
46 int n = bins.length;
49 w = Math.max(w,bins[i].getMax());
53 setHeight(bins.length-1);
71 int low = bins[i].getMin();
72 int high = bins[i].getMax();
82 Pair[] bins = visualState.argumentMinMaxArray("bins");
[all...]
/barrelfish-2018-10-04/lib/bench/
H A Dbench_ctl.c91 * Return bin index for this value. We keep two more bins than bin count, one
117 * Returns a newly allocated array of bins, filled with the desired values.
128 cycles_t *bins; local
132 bins = calloc(bin_count + 2, sizeof(size_t));
136 bins[val2bin(bin_count, min, max, *v)]++;
139 return bins;
248 cycles_t *bins; local
252 bins = do_bincounting(ctl, dimension, bin_count, min, max);
254 printf("%sbellow,%"PRIuCYCLES"\n", prefix, bins[bin_count]);
255 printf("%sabove,%"PRIuCYCLES"\n", prefix, bins[bin_coun
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dicintro.tex816 different items into the minimal number of bins under specific constraints.
824 \item There are three types of bins:
828 \item The capacity constraints imposed on the bins are:
836 \item The containment constraints imposed on the bins are:
865 number of bins required to contain the components?
925 the same, but with the bins in a different order).
936 However, because the number of bins needed is not known initially, it
939 One possibility is to take a fixed, large enough, number of bins
940 and to try to find a minimum number of non-empty bins.
942 each one with a - larger - fixed number of bins,
[all...]
H A Dfdintro.tex326 different items into the minimal number of bins under specific constraints.
334 \item There are three types of bins:
380 what is the minimum total number of bins required to
418 the same, but with the bins in a different order).
431 However, because the number of bins needed is not known initially, it
434 One possibility would be to take a fixed, large enough, number of bins
435 and to try to find a minimum number of non-empty bins.
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
443 and use no (further) bins
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/
H A Dextfd.tex1656 different things into the minimal number of bins under specific constraints.
1664 \item There are three types of bins:
1708 what is the minimum total number of bins required to
1715 bins we should take.
1716 One possibility would be to take a large enough number of bins
1719 for an increasing fixed number of bins until a solution is found.
1733 as a limit value for various domains, calls {\bf bins/4} to
1741 bins(Demand, Sum, [Sum, Sum, Sum, Sum, Sum, Sum], Bins),
1746 The predicate to generate a list of bins with appropriate
1762 bins(con
[all...]
H A Dobsman.tex1762 different things into the minimal number of bins under specific constraints.
1770 \item There are three types of bins:
1814 what is the minimum total number of bins required to
1821 bins we should take.
1822 One possibility would be to take a large enough number of bins
1825 for an increasing fixed number of bins until a solution is found.
1839 as a limit value for various domains, calls {\bf bins/4} to
1847 bins(Demand, Sum, [Sum, Sum, Sum, Sum, Sum, Sum], Bins),
1852 The predicate to generate a list of bins with appropriate
1868 bins(con
[all...]
H A Dgfd.tex762 M items into N bins, each bin having a load specified in BinLoads.
766 into N bins of size BinSize.
770 M L-Dimensional items into N L-Dimensional bins, each bin having a load in
777 items into N L-Dimensional bins, each bin having a size in each dimension.

Completed in 155 milliseconds