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 5 of 5 for “"CSP framework"”.

  1. Advances in space and time efficient model checking of finite state systems / Atanas Nikolaev Parashkevov.

    … in the Communicating Sequential Processes (CSP) framework. An approach to the compilation of CSP system descriptions into boolean formulae in the form of Ordered Binary Decision Diagrams (OBDD) is presented, further utilised by a basic algorithm that checks a refinement or equivalence …

    adelaide Repository record for Advances in space and time efficient model checking of finite state systems / Atanas Nikolaev Parashkevov. (opens in a new tab)

  2. 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)

  3. Implicit and explicit approaches for efficient healthcare scheduling

    … NSP using the Constraint Satisfaction Problem (CSP) framework. Then we develop Stochastic Local Search (SLS) methods and a new Branch and Bound (B&B) algorithm enhanced with constraint propagation techniques and variables/values ordering heuristics. Considering that our proposed implicit …

    regina Repository record for Implicit and explicit approaches for efficient healthcare scheduling (opens in a new tab)

  4. Using Conflict and Support Counts for Variable and Value Ordering in CSPs

    A Constraint Satisfaction Problem (CSP) is a very powerful framework for representing and solving constraint problems. Many real world computational problems in Artificial Intelligence and other areas of computer science can be formulated as CSPs. Problems such as scheduling and timetabling in …

    regina Repository record for Using Conflict and Support Counts for Variable and Value Ordering in CSPs (opens in a new tab) Download PDF for Using Conflict and Support Counts for Variable and Value Ordering in CSPs (opens in a new tab)

  5. Creating Systemic Support: Cross-Sector Partnerships as a Catalyst to Institutional Transformation for Southeast Asian Student Support

    … collaborations, and create an adaptable framework for other communities. By adopting an Asian Critical Race Theory (AsianCrit) lens, the research unravels the complex web of factors influencing SEAA students' educational trajectories. The study delves into historical contexts of refugee …

    usfca Repository record for Creating Systemic Support: Cross-Sector Partnerships as a Catalyst to Institutional Transformation for Southeast Asian Student Support (opens in a new tab)