Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"LEAST COMMITMENT"”.

  1. AN EMPIRICAL STUDY OF DIFFERENT BRANCHING STRATEGIES FOR CONSTRAINT SATISFACTION PROBLEMS

    … follows: first, a branching strategy with strong commitment assigns its variables in the early stage of the search as in k-Way branching; second, 2-Way branching guides a search by branching one side with assigning a variable and the other with eliminating the assigned value; third, the domain …

    waterloo Repository record for AN EMPIRICAL STUDY OF DIFFERENT BRANCHING STRATEGIES FOR CONSTRAINT SATISFACTION PROBLEMS (opens in a new tab)

  2. Lifted Heuristics: Towards more scalable Planning Systems

    … which did not require grounding (for example least-commitment planners like Partial-Order Planners), but the weakness of their heuristics prevents them to compete with the state of the art. The heuristics presented in this thesis compare favourably to the state-of-the-art. We build on previous …

    kings Repository record for Lifted Heuristics: Towards more scalable Planning Systems (opens in a new tab) Download PDF for Lifted Heuristics: Towards more scalable Planning Systems (opens in a new tab)

  3. Using discrimination graphs to represent visual knowledge

    … (elementary) objects. Following the principle of least commitment, the interpretation of each image feature is repeatedly forced into more restrictive classes as the context for the image feature is expanded, until the image no longer provides subclassification information. This approach is called …

    ubc Repository record for Using discrimination graphs to represent visual knowledge (opens in a new tab) Download PDF for Using discrimination graphs to represent visual knowledge (opens in a new tab)