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 18 of 18 for “"CONSTRAINT NETWORK"”.

  1. Constraint Network Satisfaction for Finite Relation Algebras

    Network satisfaction problems (NSPs) for finite relation algebras are computational decision problems, studied intensively since the 1990s. The major open research challenge in this field is to understand which of these problems are solvable by polynomial-time algorithms. Since there are known …

    qucosa-diss

  2. Robust controllability of temporal constraint network with uncertainty

    Temporal constraint networks with uncertainty are embedded in many scheduling problems. The fundamental problem is to decide whether such network can be executed under different uncertainty scenarios. Few works in the literature raise the question of probabilistic dynamic execution. In this thesis, …

    nus Repository record for Robust controllability of temporal constraint network with uncertainty (opens in a new tab) Download file for Robust controllability of temporal constraint network with uncertainty (opens in a new tab)

  3. Computer methods for tolerance synthesis

    … and the measurement of sufficiency. A detailed constraint network is used to represent tolerance relations for a part under design and provide for the composition of tolerance specifications. The constraint network is, in turn, associated with nominal solids describing the shape of the part …

    uiuc Repository record for Computer methods for tolerance synthesis (opens in a new tab)

  4. A web-based system with preferences for learning Qualitative Constraint Networks

    … is designed to learn and solve a Qualitative Constraint Network (QCN) based on User’s requirements and preferences in the particular case of temporal information. The constraint network is a set of time events that are related to each other. The application first asks the user to input the …

    regina Repository record for A web-based system with preferences for learning Qualitative Constraint Networks (opens in a new tab) Download PDF for A web-based system with preferences for learning Qualitative Constraint Networks (opens in a new tab)

  5. Practical tractability of CSPs by higher level consistency and tree decomposition

    Constraint Satisfaction is a flexible paradigm for modeling many decision problems in Engineering, Computer Science, and Management. Constraint Satisfaction Problems (CSPs) are in general [special characters omitted]-complete and are usually solved with search. Research has identified various …

    nebraska Repository record for Practical tractability of CSPs by higher level consistency and tree decomposition (opens in a new tab)

  6. Implicit and explicit approaches for efficient healthcare scheduling

    … usually involves satisfying a set of hard constraints while optimizing one or more objectives. In this context, exact or approximate methods can be used. While exact methods guarantee the optimality of the solution returned, they often come with an exponential running time as opposed to …

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

  7. Consistency techniques in constraint networks

    … techniques play an important role in studying constraint networks. We focus on two aspects of them: consistency as a pruning tool and consistency as a tool to relate local consistency and global consistency. For the first aspect, we mainly study arc consistency (AC). We find a simple and worst …

    nus Repository record for Consistency techniques in constraint networks (opens in a new tab) Download file for Consistency techniques in constraint networks (opens in a new tab)

  8. An Empirical Study of Distributed Constraint Satisfaction Algorithms

    … using multi-agent paradigms. Distributed Constraint Satisfaction Problems (DisCSPs) are a class of such distributed problems. In DisCSPs, variables and constraints are distributed between agents. Most distributed algorithms, although exponential in the worst-case, can have a good …

    guelph Repository record for An Empirical Study of Distributed Constraint Satisfaction Algorithms (opens in a new tab)

  9. A FUZZY DYNAMIC CONSTRAINT MODEL

    In the past few years, constraint based reasoning has received more and more attentions. It is well known that many planning and scheduling problems in the fields of information systems and artificial intelligence(AI) can be formulated as constraint based reasoning and constraint satisfaction …

    nus Repository record for A FUZZY DYNAMIC CONSTRAINT MODEL (opens in a new tab) Download file for A FUZZY DYNAMIC CONSTRAINT MODEL (opens in a new tab)

  10. Conditional Preference Networks: Constraints and Similarity

    Conditional preference networks (CP-nets) are increasingly becoming popular in representing ordinal preference relations in an efficient manner. However, one of the main issues with CP-net is that both preferences and constraints influence real-life outcomes. In this thesis, we explore two objectives …

    regina Repository record for Conditional Preference Networks: Constraints and Similarity (opens in a new tab) Download PDF for Conditional Preference Networks: Constraints and Similarity (opens in a new tab)

  11. Kinematic Analysis of a Threaded Fastener Assembly

    … and, from this, have the potential to develop a constraint network.

    vt Repository record for Kinematic Analysis of a Threaded Fastener Assembly (opens in a new tab)

  12. A CONSTRAINT-LANGUAGE-BASED ENVIRONMENT FOR GEOMETRIC DESIGN

    … to simplify 3-dimensional geometric design using constraint-based techniques and the Devi environment that grew out of this effort. Designing 3-dimensional geometric models is a painstaking and time-consuming task even with today's high performance graphics workstations. Limiting factors are the …

    nus Repository record for A CONSTRAINT-LANGUAGE-BASED ENVIRONMENT FOR GEOMETRIC DESIGN (opens in a new tab) Download file for A CONSTRAINT-LANGUAGE-BASED ENVIRONMENT FOR GEOMETRIC DESIGN (opens in a new tab)

  13. Efficient methods for qualitative spatial and temporal reasoning

    … in a qualitative calculus which could form constraint networks that make the reasoning problem difficult. This would help us to determine whether tractable reasoning is actually possible. Secondly, we investigate algebraic properties of a qualitative calculus. We present a condition of the …

    anu Repository record for Efficient methods for qualitative spatial and temporal reasoning (opens in a new tab)

  14. Methods Of Distributed And Nonlinear Process Control: Structuredness, Optimality And Intelligence

    … nonlinear and often integrated into large-scale networks, which are difficult to control effectively. The traditional challenges faced by process control, as well as the modern vision of transitioning industries into a smart manufacturing paradigm, requires the instillation of new perspectives …

    umn Repository record for Methods Of Distributed And Nonlinear Process Control: Structuredness, Optimality And Intelligence (opens in a new tab)

  15. Heuristic Approaches to Solve the Frequency Assignment Problem

    … algorithm does not exploit knowledge of the constraint network and should be applicable to a number of different problem domains. Algorithms capable of solving the frequency assignment problem most effectively will become valuable as demand for the electromagnetic spectrum continues to grow.

    goldsmiths Repository record for Heuristic Approaches to Solve the Frequency Assignment Problem (opens in a new tab) Download PDF for Heuristic Approaches to Solve the Frequency Assignment Problem (opens in a new tab)

  16. Deep Learning-based Segmentation and Registration in Microscopy Images

    … By incorporating an optimized segmentation network, attention network, and constraint network, our SAC-Net achieves highly competitive performance for weakly-supervised cell nuclei segmentation in histopathology images. To further reduce ground truth annotations, the second research proposes …

    unsw Repository record for Deep Learning-based Segmentation and Registration in Microscopy Images (opens in a new tab)

  17. ΔΙΑΤΑΞΕΙΣ ΔΙΑΓΡΑΦΩΝ, ΠΑΙΧΝΙΔΙΑ ΚΑΙ ΕΛΑΣΣΟΝΑ ΣΕ ΓΡΑΦΗΜΑΤΑ

    … SEARCHING PROBLEMS AND THEIR APPLICATION ON THE CONSTRAINT SATISFACTION PROBLEM AND THE ROUTING PROBLEM ON DISTRIBUTED COMPUTING SYSTEMS. THE BASIC RESULTS ARE THE FOLLOWING. 1) SUBLINEAR ALGORITHM FOR ENFORCING PARTIAL ARE CONSISTENCY ON NETWORKS OF CONSTRAINTS. 2) TIGHT UPPER AND LOWER BOUND …

    greece Repository record for ΔΙΑΤΑΞΕΙΣ ΔΙΑΓΡΑΦΩΝ, ΠΑΙΧΝΙΔΙΑ ΚΑΙ ΕΛΑΣΣΟΝΑ ΣΕ ΓΡΑΦΗΜΑΤΑ (opens in a new tab)

  18. Constrained traffic equilibrium : impact of electric vehicles

    … changes to the existing transportation network and travel demand modeling paradigms to accommodate changing cost structures, technological restrictions, and supply infrastructures. A prominent phenomenon is that all PEV drivers face a distance constraint on their driving range, given the …

    texas Repository record for Constrained traffic equilibrium : impact of electric vehicles (opens in a new tab)