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 20 of 26 for “"Constraint Satisfaction Problem"”.
-
ClinicalTrACE: a self-correcting agent with interpretable uncertainty for clinical question answering
… events that satisfy type, temporal, and content constraints simultaneously, a multi-constraint satisfaction problem that embedding-based systems cannot solve. We introduce ClinicalTrACE, a self-correcting agent that retrieves through explicit structured queries with no fine-tuning and no …
-
A computer-based tutor for engineering design
… mode of learning through the use of problem sets in routine engineering design domains. This thesis discusses the design of a computer-based system that benefits the instructor and the students in a design course by automating the creation of problem sets and their solution. The …
-
Enhancing the automation of forming groups for education with semantics
… formation in this approach is modelled as a constraint satisfaction problem where the criteria is a set of constraints that we aim to minimise their violation while processing the groups. The second approach uses Semantic Web domain ontologies in describing the participants to enrich the data …
-
List, Sample, and Count
… advantage of the combinatorial nature of the problem to construct an algorithm whose output is the number of structures. There are many algorithmic techniques for counting, they cover the explicit approach of counting by listing to the approximate approach of counting by sampling.</p> <p>This …
-
An engineering constraint handling and optimization system for integrated product development
… this research, the so-called ECHO (Engineering Constraint Handling and Optimization) system for integrated product development has been developed. A unique feature of this system is that it can explicitly represent and process both the upstream and downstream requirements. These requirements are …
-
Adaptive 3D web-based environment for heterogeneous volume objects.
… interactive manner are now available online, the problem of using such tools is that the user needs to acquire a certain level of modelling knowledge In this work, we identify the problem, introduce the theoretical background and discuss the theory about Web-based modelling and rendering, …
-
Risk-bounded coordination of human-robot teams through concurrent intent recognition and adaptation
… by proposing a framework that solves these two problems (task-level intent recognition and robotic adaptation) concurrently and holistically, using a single model and set of algorithms for both. The result is a mixed-initiative human-robot interaction that achieves the team's goals. The robot is …
-
Diagnosing interoperability problems and debugging models by enhancing constraint satisfaction with case -based reasoning
… dissertation proposes a framework that uses the Constraint Satisfaction Problem (CSP) paradigm to define a modeling language and problem solving mechanism for interoperability testing, and uses Case-Based Reasoning (CBR) for debugging interoperability test cases.</p><p>The dissertation makes …
-
The application and assessment of active network management techniques for distribution network power flows
… to distribution networks, presents significant problems to the planning and operation of these traditionally passive networks due to bi-directional power flows creating voltage fluctuations and uncertainty in power flow magnitudes. In addition, conventional planning methods results in financial …
-
Algorithm selection, scheduling and configuration of Boolean constraint solvers
Boolean constraint solving technology has made tremendous progress over the last decade, leading to industrial-strength solvers, for example, in the areas of answer set programming (ASP), the constraint satisfaction problem (CSP), propositional satisfiability (SAT) and satisfiability of quantified …
-
Width functions for hypertree decompositions
… database, a database query, or an instance of a constraint satisfaction problem) it also gives rise to important algorithmic results: Many problems that are NP-complete in general become polynomially tractable when restricted to instances of bounded tree-width. By a result of Grohe, tree-width is …
-
Distributed mode estimation through constraint decomposition
… in combinatorial complexity. Hence, efficient problem encoding and knowledge propagation between time steps is crucial. Moreover, concentrating all the diagnosis processing power in one machine is risky, as it creates a potential critical failure point. Therefore, we want to distribute the …
-
A Whole-Farm Planning Decision Support System for Preventive Integrated Pest Management and Nonpoint Source Pollution Control
… and soil erosion. The system is composed of a constraint satisfaction planner (CROPS-LT), a modified version of CROPS (Stone, 1995), a farm-level resource management system (FLAME), an NPS module, which includes a weather generator, CLIGEN (Nicks et al. 1995), and an NPS distributed-parameter …
-
RELAY-ASSISTED HYBRID FIBER/MMWAVE-WIRELESS BACKHAUL NETWORK
… At the same time, the load-balanced routing problem arises in the hybrid backhaul networks is also considered. First of all, in order to construct the long range ultra-high-speed millimeter wave backhaul links, relays are selected between a pair of source and destination base stations to …
-
Linear and ellipsoidal pattern separation: theoretical aspects and experimental analysis
This thesis deals with a pattern classification problem, which geometrically implies data separation in some Euclidean feature space. The task is to infer a classifier (a separating surface) from a set or sequence of observations. This classifier would later be used to discern observations of …
-
Hybrid algorithms for distributed constraint satisfaction.
A Distributed Constraint Satisfaction Problem (DisCSP) is a CSP which is divided into several inter-related complex local problems, each assigned to a different agent. Thus, each agent has knowledge of the variables and corresponding domains of its local problem together with the constraints …
-
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 …
-
Constraint-based local search for container freight rail scheduling
… of this thesis. The container rail scheduling problem is modelled as a constraint satisfaction problem in which the rail business criteria and operational constraints are represented as soft and hard constraints respectively. A constraint-based local search algorithm is developed to solve …
-
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 …
-
Constraint propagation and variable ordering heuristics for solving Constrained Partial CP-nets
… the partial CP-net along with user-defined hard constraints. This thesis contributes towards the improvement of the Search-Partial-CP algorithm along with the addition of functionality to increase usability. We address the challenges we face, in practice, when searching for a solution from a …
Page 1 of 2