/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ |
H A D | ic_probe_search.pl | 90 variable, it is simply set to its minimum value. In this case the 143 previous probe) that must be set to zero to achieve feasibility. 219 the "tightest" one that would still have to be set to zero even if we 248 Select the "tightest" binary variable that would still have to be set 271 minimum you would have to "push" the tasks to set the overlap
|
H A D | probe_search.pl | 91 variable, it is simply set to its minimum value. In this case the 144 previous probe) that must be set to zero to achieve feasibility. 220 the "tightest" one that would still have to be set to zero even if we 249 Select the "tightest" binary variable that would still have to be set 272 minimum you would have to "push" the tasks to set the overlap
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | eplex.tex | 59 by a set of simultaneous equations: an 60 objective function that is to be minimised or maximised, subject to a set of 226 % b. create the problem variables and set their range 240 % d. set up the external solver with the objective function 261 variables and set their range to be non-negative, as is conventional in MP. 266 Next, we set up the MP constraints for the 289 Having set up the problem, we can solve it 332 % f. set the problem variables to their solution values 339 value for a problem variable. The second argument, set to \verb'typed_solution', 529 % set u [all...] |
H A D | colgen.tex | 45 introduce for each stock board used a set of variables $x_{i,j}$ for 168 The cutting stock problem can be decomposed into a master problem in which an optimum combination of existing cuttings is found and a subproblem in which new cuttings are generated which could improve upon the current combination. For clarity we denote by $Q$ the set of feasible cuttings and index variables $\lambda_{\mathbf{q}}$ by the column of master problem constraint coefficients $\mathbf{q}\in Q$ corresponding to the equivalent subproblem solution: 230 where we first create a {\tt colgen} instance {\tt cut\_stock}, set up the variable domains of the subproblem and the demand constraints of the master problem, set up the initial master problem bound constraints and subproblem knapsack constraint, then solve and return the variables with non-zero values in the optimal solution. The definition of cutting cost as waste has been combined with the knapsack constraint, while the bounds placed on this cost exclude cuttings with sufficient waste to produce further boards, thus limiting the amount of search in subproblem solution. The chosen method of subproblem solution is:
|
/barrelfish-2018-10-04/include/openssl/ |
H A D | x509.h | 177 int set; member in struct:X509_name_entry_st 219 int single; /* 0 for a set, 1 for a single item (which is wrong) */ 222 /* 0 */ STACK_OF(ASN1_TYPE) *set; member in union:x509_attributes_st::__anon251 409 /* Complete set of RFC2253 flags */ 1012 int loc, int set); 1014 unsigned char *bytes, int len, int loc, int set); 1016 unsigned char *bytes, int len, int loc, int set); 1022 const unsigned char *bytes, int len, int loc, int set);
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/x509/ |
H A D | x509.h | 177 int set; member in struct:X509_name_entry_st 219 int single; /* 0 for a set, 1 for a single item (which is wrong) */ 222 /* 0 */ STACK_OF(ASN1_TYPE) *set; member in union:x509_attributes_st::__anon1297 409 /* Complete set of RFC2253 flags */ 1012 int loc, int set); 1014 unsigned char *bytes, int len, int loc, int set); 1016 unsigned char *bytes, int len, int loc, int set); 1022 const unsigned char *bytes, int len, int loc, int set);
|
/barrelfish-2018-10-04/lib/lua/src/ |
H A D | llex.c | 185 static int check_next (LexState *ls, const char *set) { argument 186 if (ls->current == '\0' || !strchr(set, ls->current))
|
/barrelfish-2018-10-04/usr/eclipseclp/Opium/ |
H A D | opium.pl | 47 /* set print_depth */ 238 % set_opium_level(Lev), % set level of current session
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/asn1/ |
H A D | a_strex.c | 461 if(prev == ent->set) { 471 prev = ent->set;
|
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/ |
H A D | map.pl | 166 % unifies Domain with the ordered set representation of the domain 180 % Set must be an *ordered* set. 202 % Set must be an *ordered* set. 254 % unifies Range with the ordered set representation of the range of the
|
H A D | logarr.pl | 19 or fails if Array[Index] has not been set. 33 of all the elements of Array that have been set.
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/ |
H A D | extchr.tex | 173 \item sets ({\tt *set*})\index{set constraints}, 498 The {\tt option} command allows the user to set options in the \chr\ 529 duplicate constraint is avoided. This option can be set to \verb/off/, 549 \item Note that the \eclipse\ environment flag \verb/debug_compile/ (set and 754 two heads. For example, in the handler for set constraints {\tt 755 set.chr}, the propagation rule: 757 set_union(S1, S2, S), set(S1, S1Glb, S1Lub), set(S2, S2Glb, S2Lub) ==> 760 set( [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/ |
H A D | eg_cc_test.cc | 183 YZ.set(1,77);
|
/barrelfish-2018-10-04/usr/eclipseclp/Visualisation/src/com/parctechnologies/eclipse/visualisation/ |
H A D | AbstractViewletDataStore.java | 114 dimNumber+" set to "+locationNames); 269 wholeSize.set(dimension-1, newDimSize);
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/ |
H A D | internal.tex | 145 \item fd/ic set solver 166 \item Cardinal set solver by Francisco Azevedo
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | umsstyle.tex | 28 This appendix gives only a sample set of rules, which can serve as a guideline. 94 \item The test set(s) should exercise 100 percent of the final code. Conformity
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/perlasm/ |
H A D | x86gas.pl | 50 elsif ($opcode =~ m/^set/&& $#_==1) { &::emit($opcode,@arg); }
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/util/pl/ |
H A D | VC-32.pl | 49 set ASM=\$(ASM) 66 # Idea behind this is to mimic flags set by eVC++ IDE...
|
/barrelfish-2018-10-04/lib/spawndomain/ |
H A D | spawn_omp.c | 339 err = r->rpc_tx_vtbl.set(r, record, 0, NOP_TRIGGER,
|
/barrelfish-2018-10-04/usr/arrakismon/ |
H A D | lpc.h | 178 uint8_t set : 1; ///< Update Cycle Inhibit member in struct:lpc_rtc_b::__anon1445
|
/barrelfish-2018-10-04/include/arch/aarch64/machine/ |
H A D | atomic.h | 98 ATOMIC(set, orr)
|
/barrelfish-2018-10-04/usr/monitor/capops/ |
H A D | capsend.c | 173 if (dests && dests->set == NULL) { 174 dests->set = calloc(dest_count, sizeof(coreid_t)); 195 // if we're initializing destination set, add destination 196 // cores that we were able to enqueue msg for to set. 197 dests->set[dests->count++] = dest; 218 coreid_t dest = dests->set[i];
|
/barrelfish-2018-10-04/usr/skb/programs/ |
H A D | decoding_net.pl | 190 %% Extract blocks from translate set
|
H A D | globalthreadalloc.pl | 294 % max nr threads set according to stored data: 596 % set the working set size per core 597 % This helps deciding whether the sum of the working set of all cores
|
/barrelfish-2018-10-04/usr/vmkitmon/ |
H A D | lpc.h | 185 uint8_t set : 1; ///< Update Cycle Inhibit member in struct:lpc_rtc_b::__anon1817
|