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 programming (Computer Science)"”.
-
Computing explanations for interactive constraint-based systems
Constraint programming has emerged as a successful paradigm for modelling combinatorial problems arising from practical situations. In many of those situations, we are not provided with an immutable set of constraints. Instead, a user will modify his requirements, in an interactive fashion, until …
-
Promise constraint satisfaction problems
… the complexity of various approximations of constraint satisfaction problems. In the constraint satisfaction problem (CSP), we are given a set of variables, a domain for the variables, and a set of constraints on those variables, and must construct an assignment of values from the domain to …
-
Implications of Services-Oriented Architecture and Open Architecture composable systems on the acquisition organizations and processes
… instead, it is intended to alleviate some of its constraints. This thesis will focus on utilizing SOA and OA in IWS, how SOA and OA principles relate, and the effects they will have on the Defense Acquisition System's organizations and processes.
-
A formal analysis of the MLS LAN: TCB-to-TCBE, Session Status, and TCBE-to-Session Server Protocols
… with an application of John Millen's automated Constraint Checker analysis tool to the Strand Space representations under an extremely limited set of conditions to prove certain protocol secrecy properties.
-
A multi-phase approach to university course timetabling
Course timetabling is a well known constraint satisfaction optimization (CSOP) problem, which needs to be solved in educational institutions regularly. Unfortunately, this course timetabling problem is known to be NP-complete [7, 39]. This M.Sc. thesis presents a multi-phase approach to solve the …
-
Finding optimal alternatives based on efficient comparative preference inference
… of behavior or options subject to given constraints with regards to a set of preferences. When solving a constrained optimization problem, pruning techniques, such as the branch and bound technique, point at directing the search towards the best assignments, thus allowing the bounding …
-
Reasoning with sorted-pareto dominance and other qualitative and partially ordered preferences in soft constraints
… one. We apply Sorted-Pareto dominance to a Soft Constraints setting, where we solve problems in which the soft constraints associate qualitative preferences to decisions in a decision problem. We also examine the Sorted-Pareto dominance relation in the context of our qualitative decision making …
-
Identifying sources of global contention in constraint satisfaction search
… nogood and explanation-based learning, and constraint weighting in constraint satisfaction problems (CSPs). Many of the top solvers in SAT use clause learning to good effect. A similar approach (nogood learning) has not had as large an impact in CSPs. Constraint weighting is a less …
-
Optimization Approaches to Protein Folding
… protein folding model. We built two integer programming (IP) models and five constraint programming (CP) models. All the models give provably optimal solutions. We also developed some CP techniques to solve the problem faster and then compared their computational times. We tested the models …
-
Automating Component-Based System Assembly
… assembly that satisfies the system assembly constraints is difficult. Component technologies like CORBA and .NET do a very good job of integrating components, but they do not automate component assembly; it is the system developer's responsibility to ensure thatthe components are assembled …
-
Dual Constraint Problem Optimization Using A Natural Approach: Genetic Algorithm and Simulated Annealing
Constraint optimization problems with multiple constraints and a large solution domain are NP hard and span almost all industries in a variety of applications. One such application is the optimization of resource scheduling in a "pay per use" grid environment. Charging for these resources based on …