/barrelfish-2018-10-04/usr/eclipseclp/documents/visualisation/ |
H A D | visualisation.tex | 126 This manual contains information on the modelling level search and
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/test/ |
H A D | testssl.com | 29 $ search/output=nla0: testssl-x509-output. "DSA Public Key"/exact
|
/barrelfish-2018-10-04/usr/skb/programs/ |
H A D | route_tree_radix.pl | 14 % make groups of numbers to be able to do a breadth-first search
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | Makefile | 34 modelling.tex search.tex eplex.tex colgen.tex \
|
H A D | constimpl.tex | 53 This will succeed with X = 3 after some search. 57 a ``constraint'' because of its backtracking (search) behaviour: 131 problem to be satisfiable. It is still necessary to search for solutions. 138 \item at what time during search do we want to (re)establish this consistency? 182 and we want to achieve a separation of constraint propagation and search. 184 which controls search and constraint propagation globally for the whole 187 the search process is controlled by an algorithmic program, 306 In terms of the search tree, this means that a branch will not be pruned
|
H A D | fdintro.tex | 46 The labeling/1 procedure is the search part of the program. It 48 variables. This search is being pruned by constraint propagation. 52 procedure around the search component of the program: 282 The {\em fd\_search} library provides a variety of search routines 302 instantiated, by Goal. Usually, Goal is the search 306 is recorded and the search is continued or restarted with an 648 The search is done by first choosing a colour for each bin, and then
|
H A D | propiachr.tex | 117 \item Specify the search behaviour 129 \item Posting and reposting constraints during search is an 131 \item Mixing constraint behaviour and search behaviour makes it harder 134 Propia and CHR's support the separation of constraint setup and search 525 current search state), the 640 variables are accumulated during search. 679 The idea is to search the constraint store for a disequality between 827 Note: you are not allowed to load the ic library nor to use search and
|
H A D | eplex.tex | 520 With the branch-and-bound approach, a search-tree is formed, and at each node a 546 The task of the search is to find integer assignments 549 search-tree solves the problem with extra bound constraints on these 553 consider two alternate problems, which creates two branches in the search. In one 582 needs to backtrack into the tree to search for a better solution by trying 585 This `branch-and-bound' search technique is implemented in {\tt 727 is the optimal value after the branch-and-bound search, i.e.\ the
|
H A D | icintro.tex | 56 The \verb0labeling/10 predicate is the search part of the program that 58 variables. This search is constantly pruned by constraint propagation. 62 procedure can be wrapped around the search component of the program: 807 \See{Additional information on search algorithms, heuristics and their 1099 The search is done by first choosing a colour for each bin, and then 1105 search(Vars, 0, first_fail, indomain, complete, []). 1111 \See{Additional information on search algorithms, heuristics and their
|
/barrelfish-2018-10-04/usr/eclipseclp/GecodeInterface/ |
H A D | gfd.hpp | 25 #include <gecode/search.hh> 124 Gecode::IntActivity* actp; // for using IntActivity outside search engines 150 /// Reason why search has been stopped 157 /// Test whether search must be stopped 174 /// Report reason why search has been stopped
|
/barrelfish-2018-10-04/usr/eclipseclp/lib_tcl/widget/ |
H A D | console.tcl | 985 ## Search forward (next) if $int>0, otherwise search back (prev) 996 ## String is not empty, do an event search 1573 set i [$w search -backwards -regexp $exp insert-1c limit-1c] 1578 set i [$w search -backwards -regexp $exp insert-1c limit-1c] 1609 if {[string compare [set ix [$w search -back $c1 insert $lim]] {}]} { 1611 [string compare [set ix [$w search -back $c1 $ix-1c $lim]] {}]} {} 1616 while {[string compare [set i0 [$w search $c2 $i0 $i1]] {}]} { 1624 [set ix [$w search -back $c1 $ix $lim]] {}]} { 1652 while {[string compare {} [set i [$w search -back \" $i $lim]]]} { 1724 set tmp [$w search [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | fd.pl | 1936 see_also:[/(::, 2), /(#::, 2), /(par_indomain, 1), labeling/1, fd_search:search/6]]). 2222 solution is found that is worse than a previous solution, the search is 2244 solution is found that is worse than a previous solution, the search is 2317 solution is found that is worse than a previous solution, the search is 2327 search space is too large or when a suboptimal solution is sufficient. 2347 solution is found that is worse than a previous solution, the search is 2362 search space is too large or when a suboptimal solution is sufficient. 2386 solution is found that is worse than a previous solution, the search is 2482 the search for a better solution continues. Every time a new 2488 finding a solution, the search i [all...] |
H A D | cp_min.pl | 47 iii. pmin: min with pessimistic search (used only for 90 /* Psm_Flag specifies whether to use pessimistic search when
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | umsintro.tex | 46 constraint programming, mathematical programming, and search 89 visualisation of constraint propagation and search. 166 %search. {\eclipse} offers a complete system for Horn clause logic 168 %the occur check and for the depth-first iterative deepening search rule.
|
H A D | umscmdlineopts.tex | 127 The system will first search for these files in the current directory,
|
/barrelfish-2018-10-04/usr/eclipseclp/Mercury/ |
H A D | m_tree234.pl | 36 search/3, 102 see_also: [search/3, lookup/3], 118 % :- pred search(tree234(K, V), K, V). 119 % :- mode search(in, in, out) is semidet. 120 :- comment(search/3, [ 121 amode: search(+, ++, ?), 123 "Key":"A key to search for", 147 "Key":"A key to search for", 152 see_also: [member/3, search/3], 172 "SearchKey":"A key to search fo [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ |
H A D | ic_probe_search.pl | 44 Cost - A variable whose value will be minimised during search 89 add_biv_cstr is used in search. If the variable is a resource 297 A search routine which fixes resource bottlenecks by forcing tasks not to overlap.
|
H A D | probe_search.pl | 45 Cost - A variable whose value will be minimised during search 90 add_biv_cstr is used in search. If the variable is a resource 298 A search routine which fixes resource bottlenecks by forcing tasks not to overlap.
|
H A D | repair.pl | 127 :- comment(summary, "Repair library: support for local search via tentative assignments and repair constraints"). 134 search with the constraint consistency checking techniques of ECLiPSe. It 135 allows the implementation of classical local search methods within a CLP 150 constraints that are violated at any point in the search, 164 :- comment(index, ["local search", "tentative assignments"]). 434 will often make the search algorithm easier and more efficient. 440 search algorithm. 488 will often make the search algorithm easier and more efficient. 494 search algorithm.
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/ |
H A D | embed.tex | 316 \subsection{Control flow and search} 319 execution of C++ code and search within the {\eclipse} are interleaved. 354 It is possible also to cut such search. So for example one could modify 480 {\eclipse} is a software engine for constraint propagation and search tasks. 483 \index{search} 488 and garbage collection, modifications that can be undone in a search context, 746 \verb.EC_ref.s work like logical variables. When {\eclipse} fails during search
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/ |
H A D | extfd.tex | 240 the search restarts from the beginning. 249 When a new better solution is found, the search does not restart 250 from the beginning, but a failure is forced and the search continues. 280 equivalent and so the search for next better solution starts 291 the search is aborted and the best solution found so far is 642 A library of different search methods for finite domain problems 843 and changes are propagated to the other variables, the search space 855 A guideline is that the search space should be as small as possible, 857 (i.e.\ search space size is $10^5$) 864 other constraints, can speed up the search considerabl [all...] |
H A D | introduction.tex | 123 In addition to constraints, {\em ic} offers search techniques 159 The use of tentative values in search is illustrated in the \eclipse\
|
/barrelfish-2018-10-04/usr/eclipseclp/Opium/demo/ |
H A D | pendulum.pl | 142 % search(Vertices)
|
/barrelfish-2018-10-04/doc/021-cpudriver/ |
H A D | cpudriver.tex | 114 On start-up, GRUB will search the supplied kernel module (on x86-64 this is the 120 and stack for execution. \pathname{elver.c} will then search for a
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/mpslib/ |
H A D | eclipse.tex | 83 search problem at hand. Occasionally a worker runs into an exceptional
|