Searched refs:large (Results 26 - 50 of 80) sorted by relevance

1234

/barrelfish-master/usr/eclipseclp/Kernel/lib/
H A Dfd.pl92 checks. If the domain ranges or coefficients are too large,
889 domain variables. If Var is instantiated, N is bound to a very large
1070 representation of large intervals into an explicit list of their
1177 representation of large intervals into an explicit list of their
1959 exceptions:[4 : "List is not ground.", 5 : "List contains an element which is neither integer nor an integer interval.", 6 : "The size of the resulting domain is too large.", 6 : "The list is not sorted properly."],
2027 exceptions:[4 : "List is not ground.", 5 : "List contains an element which is neither atomic nor an integer interval.", 6 : "The size of the resulting domain is too large.", 6 : "The lower bound of an integer interval is greater than its upper bound."],
2327 search space is too large or when a suboptimal solution is sufficient.
2362 search space is too large or when a suboptimal solution is sufficient.
2590 search space is too large or when a suboptimal solution is sufficient.
2625 search space is too large o
[all...]
H A Dtracer_tcl.pl578 % named (or large) structure
586 % a large structure displayed with argument positions
592 % not named nor large structure
677 valid_pos(N0=_, N) ?- integer(N0), N = N0. %named struct (or large struct)
1724 % flush before the queue buffers get too large...
H A Dcalendar.pl46 awkward because they change at noon and are very large numbers).
/barrelfish-master/usr/eclipseclp/documents/libman/
H A Dfdglobal.tex46 which simply indicates that they can constrain a large number of variables
H A Dextfd.tex93 If the domain ranges or coefficients are too large,
897 If the search space is large, it usually pays off to spend
1716 One possibility would be to take a large enough number of bins
2166 This may occur if large coefficients are used, if domains are
2167 too large or a combination of the two.
H A Dgfd.tex70 provided by Gecode -- and Gecode supports a large set of constraints. The
101 be given a default domain, which should be large enough for
113 convention is still a good idea, since overly large domains can negatively
1427 this leads to faster execution times. However, if the program has a large
H A Dic.tex79 manipulated become large enough that they approach the precision
175 provides a way of knowing how large the error may have become.
191 up to the user to decide how large an error is tolerable for any given
1212 builtin constraints is rarely able to solve large problems completely
/barrelfish-master/usr/eclipseclp/documents/tutorial/
H A Dtutorial.tex132 A methodology for developing large scale applications with \eclipse{}
H A Dsearch.tex60 The search space is usually very large because it grows exponentially
165 is only possible if large sub-spaces can be excluded a priori, and this
374 By combining variable and value selection alone, a large number of different
901 discrepancy will become large enough to admit a solution, or cover
H A Dsolversintro.tex210 large, one may even need to resort to incomplete search.
H A Dtkdebug.tex388 due to the `print depth' feature, which shortens the printing of large
564 \item[Inspector] term inspector. Useful for viewing large terms.
H A Dumsusing.tex420 another file, and so large programs can be split between files, while
442 directory. (Note that if your program is large enough to warrant
H A Dhybrid.tex428 large multipliers, can be used to translate any disjunction of linear
685 However for large applications it is best to send constraints only to
929 large problems, and the \eclipse{} library {\tt colgen}, described in
/barrelfish-master/usr/eclipseclp/documents/userman/
H A Dumsstring.tex153 It should be used when handling large amounts of input, when the extreme
H A Dumsporting.tex78 a popular Prolog with large user base.
H A Dumsintro.tex200 %build large applications, avoid name clashes and to hide information
/barrelfish-master/usr/eclipseclp/documents/embedding/
H A Ddbi.tex36 A number of features are designed to permit transfer of large amounts
287 database, and the data is too large for the database, the exact behaviour
289 database, and the data is too large for the buffer, an error will be raised.
H A Dembed.tex550 cases, since large terms are constructed on the {\eclipse} global stack.
865 to get an estimate of how large the string would be that represents it.
/barrelfish-master/usr/eclipseclp/documents/visualisation/
H A Dclients.tex246 when visualising large \viewable{}s which may not easily fit the
288 So as to facilitate visualisation of large \viewable{}s, all \viewer{}s
587 visualisation of large programs.
/barrelfish-master/doc/021-cpudriver/
H A Dcpudriver.tex159 large as the smallest page size. The type-specific parameters are:
/barrelfish-master/usr/eclipseclp/Contrib/
H A Drdtok.pl25 large integers are not read in as xwd(Top18Bits,Bottom18Bits)
/barrelfish-master/doc/014-bulk-transfer/
H A Dbulk-transfer.tex18 \tnkey{Bulk Transport: Cross-domain transfer facility for large data}
179 for multicore architectures where presence of large number of cores is
222 the large extent. What this document is aiming is to choose
380 the slot size and the side-effects of small or large size are
907 solution scales well with large number of private-mutable
/barrelfish-master/usr/eclipseclp/documents/applications/
H A Dtutorial.tex40 \begin{center}\fbox{\large TECHNICAL REPORT IC-PARC-#1}\end{center}
45 \large #3
69 In this tutorial we provide a methodology for developing large scale
86 This tutorial is an introduction to the design, development, test and maintenance of large scale applications with the ECLiPSe system. It follows a top-down methodology of converting an initial high-level specification into executable code of high quality. We assume that fundamental decisions on selecting the right tool and the right problem solver have already been taken so that we are commited to using ECLiPSe and one of its problem solving libraries. We are basically interested in the engineering aspects of the program development, not its research and development content.
211 This structure is typical for large scale combinatorial optimization\index{large scale combinatorial optimization} (LSCO)\index{LSCO} problems. The flow analysis part of RiskWise follows this structure. It consists of five parts, where each performs one particular task.
367 "Sizes":"the sizes of min, small, large, max packets",
1846 In a large program, it may be difficult to leap directly to the interesting part of the program. But we may have to repeat this operation several times, if we repeatedly leap/skip over an interesting statement. We can use the invocation number of a statement to jump\index{jump} to this exact place in the execution again. The invocation number\index{invocation number} is printed in parentheses at the beginning of each trace line. By re-starting the debugger, copying this number into the text field to the right of the button {\it To Invoc:}\index{To Invoc} and then pressing this button we can directly jump to this location.
1848 Unfortunately, jumping to an invocation number can be quite slow in a large program. The debugger has to scan each statement to check its invocation number. It can be faster (but more tedious) to use skip and leap commands to reach a program point\footnote{Experiment! Your mileage may vary!}.
1867 \item A more complex test can be used to exercise all (or nearly all) of the program code. The test data must contain enough variation to force all alternative parts in the program. This can be achieved either by accumulating large numbe
[all...]
/barrelfish-master/doc/000-overview/
H A DOverview.tex718 \item[Hakefiles.hs] A very large Haskell source file containing all
722 \item[Makefile] A very large Makefile, which contains explicit rules
838 \item \textbf{Bulk Transfer:} A proposed design for transferring large
/barrelfish-master/usr/eclipseclp/documents/search/
H A Dsearch.tex88 The search space is usually very large because it grows exponentially
186 is only possible if large sub-spaces can be excluded a priory, and this
375 By combining variable and value selection, a large number of different
803 discrepancy will become large enough to admit a solution, or cover

Completed in 217 milliseconds

1234