/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/ |
H A D | repair.tex | 43 or even inconsistent {\em tentative assignment}. 44 Modifications to, or extensions of this assignment may be 49 assignment. Search algorithms can then access the set of 51 and perform repairs by changing the tentative assignment 135 \index{tentative assignment} 136 The notion of a {\em tentative assignment} is the means of integration 137 with the consistency methods of {\eclipse}. The tentative assignment 140 The tentative assignment is a function of the groundness and tenability of 159 \item The tentative assignment is undefined for any of its variables. 160 \item The constraint fails under the tentative assignment [all...] |
H A D | ic.tex | 145 it is preferable to use an equality constraint to do the assignment). 233 explicitly given within a program. By replacing the assignment to Y 501 Provides a reified form of the {\tt ::/2} domain assignment predicate. This
|
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ |
H A D | repair.pl | 144 tentative assignment. Modifications to, or extensions of this 145 assignment may be applied until a correct solution is found. 149 assignment. Search algorithms can then access the set of 151 and perform repairs by changing the tentative assignment 664 % ground check failed or no pssible global assignment 758 % this construct the global assignment for Original in Copy. 762 % In the case that Untenable is a variable, no global assignment 784 % This finds the global assignment for Term. If due to the 785 % presence of a non-tenable variable there was no global assignment 787 % The global assignment i [all...] |
H A D | ic_make_overlap_bivs.pl | 228 tentative assignment feasible. In case a bottleneck task has a
|
H A D | make_overlap_bivs.pl | 228 tentative assignment feasible. In case a bottleneck task has a
|
H A D | ic_probe_search.pl | 50 tentative assignment feasible. In case a bottleneck task has a 315 tentative assignment feasible. In case a bottleneck task has a
|
H A D | probe_search.pl | 51 tentative assignment feasible. In case a bottleneck task has a 316 tentative assignment feasible. In case a bottleneck task has a
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | repairtut.tex | 39 complete, infeasible, assignment of values to variables and 40 change the values of the variables until a feasible assignment is 199 Finding an initial assignment of tentative values for all the problem 414 There is no guarantee that this move will reach a better assignment, 469 Each tentative assignment to the variables is propagated to the 472 assignment of the propositional variables, the number of satisfied 608 The idea of Random walk is to start from a random tentative assignment of
|
H A D | search.tex | 53 \index{assignment} 54 we call this an {\em assignment}. If every problem variable is given 55 a value, we call this a {\em total assignment}. 56 \item A total assignment is a {\em solution} if it satisfies all the 954 %assignment to the problem variables specified in advance of the
|
/barrelfish-2018-10-04/tools/fof/ |
H A D | FutureWork.tex | 20 \item[More efficient redundant assignment optimizer:] in
|
/barrelfish-2018-10-04/lib/lua/src/ |
H A D | lparser.c | 1094 ** assignment 1103 ** check whether, in an assignment to an upvalue/local variable, the 1104 ** upvalue/local variable is begin used in a previous assignment to a 1106 ** use this safe copy in the previous assignment. 1118 lh->v.u.ind.t = extra; /* previous assignment will use safe copy */ 1123 lh->v.u.ind.idx = extra; /* previous assignment will use safe copy */ 1136 static void assignment (LexState *ls, struct LHS_assign *lh, int nvars) { function 1139 if (testnext(ls, ',')) { /* assignment -> ',' suffixedexp assignment */ 1147 assignment(l [all...] |
/barrelfish-2018-10-04/usr/skb/programs/ |
H A D | bridge_page_orig_naturally_aligned.pl | 71 % create an assignment for all PCI buses (all root bridges and their children)
|
H A D | bridge_postorder.pl | 81 % construct a tree and do the assignment
|
H A D | bridge_postorder_sorted.pl | 85 % construct a tree and do the assignment
|
H A D | bridge_postorder_sorted_ascending.pl | 85 % construct a tree and do the assignment
|
H A D | bridge_postorder_sorted_sum.pl | 86 % construct a tree and do the assignment
|
H A D | bridge_postorder_sorted_sum_ascending.pl | 85 % construct a tree and do the assignment
|
H A D | bridge_page.pl | 92 % create an assignment for all PCI buses (all root bridges and their children)
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/search/ |
H A D | search.tex | 83 we call this an {\em assignment}. If every problem variable is given 84 a value, we call this a {\em total assignment}. 85 \item A total assignment is a {\em solution} if it satisfies all the 823 assignment to the problem variables specified in advance of the 1079 assignment, i.e. it is checked whether they would be satisfied 1139 strategy. The idea is to start from a random tentative assignment of
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/ |
H A D | io.tex | 103 assignment of characters to classes can be modified in {\eclipse} by
|
H A D | runtime.tex | 417 A side effect of this is, that destructive assignment operations
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | umsintro.tex | 182 %assignment.
|
H A D | extmeta.tex | 186 these modifications using destructive assignment.
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/applications/ |
H A D | tutorial.tex | 470 Note that all our data structures use {\it single assignment}\index{single assignment}, i.e. there is no destructive assignment\index{destructive assignment} in the language\footnote{Destructive assignment in the hash library is hidden from the user.}. Instead of removing\index{remove data}\index{change data}\index{delete data} or changing elements of a structuce, we will always make a near-copy with some information being removed or changed.
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/ |
H A D | embed.tex | 761 is not like unification since assignment cannot fail. It
|