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 6 of 6 for “"constraint processing"”.

  1. Aggregation and constraint processing in lifted probabilistic inference

    … in directed first-order probabilistic models and constraint processing during lifted inference. Recent work on exact lifted inference focused on undirected models. Directed first-order probabilistic models require an aggregation operator when a parent random variable is parameterized by logical …

    ubc Repository record for Aggregation and constraint processing in lifted probabilistic inference (opens in a new tab) Download PDF for Aggregation and constraint processing in lifted probabilistic inference (opens in a new tab)

  2. Efficient Location Constraint Processing for Location-aware Computing

    … this problem, referring to it as the location constraint matching problem, both in the Euclidean space and the road network space. In the Euclidean space, we present an adaptive solution to this problem for various environments. We also study the position uncertainty associated with the …

    toronto-retro Repository record for Efficient Location Constraint Processing for Location-aware Computing (opens in a new tab)

  3. Sports scheduling: an artificial intelligence approach

    … solutions. The rst approach combines ACO with constraint processing techniques in order to handle the hard constraints of the TTP. The key component is creating a framework which uses forward-checking and con ict-directed backjumping to handle the constraints while using ACO for choosing the …

    auckland-ms Repository record for Sports scheduling: an artificial intelligence approach (opens in a new tab)

  4. Managing Constraints and Preferences: Constrained Tradeoffs-Enhanced Conditional Preference Networks (CTCP-NETS)

    In this thesis, a new framework for constraint and preference representation and reasoning is proposed, including the related definitions, algorithms and implementations. A Conditional Preference Network (CP-Net) is a widely used graph model to present the preferences among various outcomes. It …

    regina Repository record for Managing Constraints and Preferences: Constrained Tradeoffs-Enhanced Conditional Preference Networks (CTCP-NETS) (opens in a new tab) Download PDF for Managing Constraints and Preferences: Constrained Tradeoffs-Enhanced Conditional Preference Networks (CTCP-NETS) (opens in a new tab)

  5. Interval methods for global optimization

    We propose interval arithmetic and interval constraint algorithms for global optimization. Both of these compute lower and upper bounds of a function over a box, and return a lower and an upper bound for the global minimum. In interval arithmetic methods, the bounds are computed using interval …

    uvic Repository record for Interval methods for global optimization (opens in a new tab)

  6. Beyond the Frontiers of Timeline-based Planning

    … objectives such as states to be avoided and constraints on state trajectories or utility functions are not handled. In order to relax these restrictions, some alternative approaches have been proposed over the years. The timeline-based approach to planning, in particular, represents an …

    plymouth Repository record for Beyond the Frontiers of Timeline-based Planning (opens in a new tab)