Searched refs:Search (Results 1 - 25 of 27) sorted by relevance

12

/barrelfish-master/usr/eclipseclp/GecodeInterface/
H A Dgfd.hpp135 class Cutoff : public Gecode::Search::Stop {
137 Search::NodeStop* ns; ///< Used node stop object
138 Search::FailStop* fs; ///< Used fail stop object
139 Search::TimeStop* ts; ///< Used time stop object
140 // Search::MemoryStop* ms; ///< Used memory stop object
145 : ns((node > 0) ? new Search::NodeStop(node) : NULL),
146 fs((fail > 0) ? new Search::FailStop(fail) : NULL),
147 ts((time > 0) ? new Search::TimeStop(time) : NULL),
148 // ms((mem > 0) ? new Search::MemoryStop(mem) : NULL),
158 virtual bool stop(const Search
[all...]
H A Dgfd.cpp4837 Search::Cutoff* cutoff; \
4844 cutoff = Search::Cutoff::geometric((unsigned long)l,b); \
4848 cutoff = Search::Cutoff::luby((unsigned long)l); \
4859 cutoff = Search::Cutoff::rnd(seed,min,max,l); \
4863 cutoff = Search::Cutoff::constant((unsigned int)l); \
4867 cutoff = Search::Cutoff::linear((unsigned int)l); \
5152 Search::Options o;
5171 o.cutoff = Search::Cutoff::constant(ULONG_MAX);
5381 Search::Statistics stat = searchp->statistics();
/barrelfish-master/lib/acpica/source/components/disassembler/
H A Ddmnames.c370 ACPI_PARSE_OBJECT *Search; local
410 /* Search upwards in the tree to find scope with "prev" as its parent */
412 Search = Op;
415 if (Search->Common.Parent == Prev)
422 Search = Search->Common.Parent;
427 OpInfo = AcpiPsGetOpcodeInfo (Search->Common.AmlOpcode);
458 Name = AcpiPsGetName (Search);
466 Prev = Search;
/barrelfish-master/usr/eclipseclp/documents/tutorial/
H A Dtutorial.tex319 % <sect> Writing your own Search
328 % <chapt> Advanced Search
332 % <sect> Least Discrepancy Search
347 % <chapt> Search and Repair
H A Dsearch.tex23 \chapter{Tree Search Methods}
46 Search is necessary since generally the implementation of the constraints
69 \subsection{Overview of Search Methods}
81 Search methods now differ in the way in which these assignments
136 \caption{Search space structured using a search tree}
176 \subsection{Optimisation and Search}
245 \section{Complete Tree Search with Heuristics}
269 \subsection{Search Trees}
386 Variables& Search space& Visiting orders& Selection Strategies\\
639 \section{Incomplete Tree Search}
[all...]
H A Drepairtut.tex23 \chapter{Repair and Local Search}
370 \section{Introduction to Local Search}
512 \quickref{Local Search and Invariants}{Local
520 \section{More Advanced Local Search Methods}
570 \subsection{Search Code Schema}
575 %Localizer: A Modeling Language for Local Search,
734 \subsection{Tabu Search}
735 \index{tabu Search}
793 \quickref{Implementing Search}{Repair can be used to implement a wide
H A Dsolversintro.tex154 Search can be carried out either in \eclipse{} or in the external solver.
199 \section{Search and Optimisation Support}
202 \subsection{Tree Search Methods: {\em ic_search}}
233 \subsection{Repair and Local Search: {\em repair}}
H A Dmodelling.tex39 separation of Modelling, Algorithms and Search.
53 Control = Reasoning + Search
66 \item {\bf Search} - The choice of search {\em strategies and heuristics} for
H A Dfdintro.tex95 % Search
646 \subsection{Search}
H A Dsetsolver.tex257 \section{Search Support}
H A Dicintro.tex107 % Search
1097 \subsection{Search}
H A Dhybrid.tex253 both_opt(Search,Obj,Cost) :-
257 minimize((Search,eplex_get(cost,Cost)),Cost).
/barrelfish-master/usr/eclipseclp/documents/search/
H A Dsearch.tex45 %\title{{\huge Search in ECLiPSe}}
56 %\chapter{Search Methods}
76 Search is necessary since generally the implementation of the constraints
97 \subsection{Overview of Search Methods}
109 Search methods now differ in the way in which these assignments
157 \caption{Search space structured using a search tree}
197 \subsection{Optimisation and Search}
250 \section{Complete Tree Search with Heuristics}
272 \subsection{Search Trees}
386 Variables& Search spac
[all...]
/barrelfish-master/usr/eclipseclp/Kernel/lib/
H A Dcp_min.pl159 fork(Numspec, Search),
160 arg(Search,Factors,F),
161 exhaustive_search(spec,Search,Goal,Cost,P,L,H,F,CostMonitor,Module).
H A Dmeta.pl289 % Search those attributes for which a like-named structure is visible.
/barrelfish-master/lib/openssl-1.0.0d/Netware/
H A Dcpy_tests.bat88 echo Make sure the Search path includes the OpenSSL subdirectory
/barrelfish-master/usr/eclipseclp/documents/libman/
H A Dintroduction.tex160 ``Tutorial on Search Methods''.
181 Search can be carried out either in \eclipse\ or in the external solver.
H A Dfdsets.tex221 \section{Search Support}
H A Drepair.tex49 assignment. Search algorithms can then access the set of
56 methods within a CLP environment (see {\em Tutorial on Search Methods}).
413 of local search, can be found in the {\em Tutorial on Search Methods}.
H A Dgfd.tex895 \section{Search Support}
908 Search can be performed in Gecode using one of its search engines.
991 \subsection{Search in {\eclipse} using GFD primitives\label{searchgfd}}
1208 (Symmetry Breaking During Search) in \texttt{lib(gfd_sbds)}.
/barrelfish-master/usr/eclipseclp/icparc_solvers/ilog/
H A Dfd_ilog.pl65 % Search
/barrelfish-master/usr/eclipseclp/documents/intro_paper/
H A Declipse.tex2121 \section{Search}
2124 \subsection{Constructive Search}
2137 \subsubsection{Depth-First Search and Backtracking}
2148 \subsubsection{{\em Guesses} - Constraints Imposed During Search}
2149 Search is, of course, much more general than just labelling.
2169 \subsubsection{MIP Search}
2201 \subsubsection{Search Heuristics based on Hybrid Solvers {\em fdplex}}
2237 {\bf Search with the {\em fdplex} Library}
2290 {\bf Tracing {\em fdplex} Search}
2327 \subsubsection{Incomplete Constructive Search}
[all...]
/barrelfish-master/usr/eclipseclp/documents/userman/
H A Dumsintro.tex160 %\subsection{Occur Check and Complete Search Rule}
/barrelfish-master/lib/openssl-1.0.0d/engines/
H A Dmakeengines.com403 $! End The Option File Search.
/barrelfish-master/usr/eclipseclp/icparc_solvers/
H A Drepair.pl149 assignment. Search algorithms can then access the set of

Completed in 153 milliseconds

12