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 2841 for “"Constraint"”.
-
Constraint-Based Interpolation
… present a new reconstruction algorithm known as Constraint-Based Interpolation, which estimates the sampling functions found in cameras and analyzes properties of real world images in order to produce quality real-world image magnifications. To accomplish this, Constraint-Based Interpolation uses …
-
Constraint-based facilities planning
In recent years a large variation of production volume for the mass-production products happens frequently due to the changes in technology and market. Those changes cause introduction of new products having shorter life cycles, thus enforcing modification and renewal of production facilities much …
-
Constraint Driven Behavioral Synthesis
The model for constraint driven automated design is presented. This model defines a simple "Knob" and "Gauge" approach to meeting the imposed design constraints. Key to this approach is an iterative process of refinement of the design followed by evaluations of the result. These evaluations are …
-
Constraint-based cinematic editing
Thesis (M.S.V.S.)--Massachusetts Institute of Technology, Dept. of Architecture, 1989.
-
Opinion Analysis through Constraint Optimisation
… be automatically learnt from review data using constraint optimisation. Thirdly, instead of providing just a binary positive or negative output, our model can be used to provide a graded overall sentiment. Our experiments show that our model provides state-of-the-art opinion classi�cation.
-
Constraint-basierte Generierung realitätsnaher Eisenbahnnetze
… sind. Zur Einhaltung dieser Bedingungen wird die Constraint-Programmierung eingesetzt, welche durch ihr spezielles Programmierparadigma konsistente Lösungen effizient erzeugt. Dies wird u.a. durch die Nachnutzung so genannter globaler Constraints erreicht. Aus diesem Grund wird insbesondere auf …
-
Partial compilation of constraint problems
Constraint Programming (CP) is a powerful paradigm for solving combinatorial problems, but due to a large search space, solving can be very time consuming. Diagnosis, planning, product configuration are example use-cases [XBZ+ 21]. These problems are often used in an online setting, where a user …
-
Descriptive complexity of constraint problems
Constraint problems are a powerful framework in which many common combinatorial problems can be expressed. Examples include graph colouring problems, Boolean satisfaction, graph cut problems, systems of equations, and many more. One typically distinguishes between constraint satisfaction problems …
-
Constraint management in conceptual design
Thesis (Sc. D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 1988.
-
Exploring constraint removal motion planners
We present algorithms for motion planning that can tolerate collisions. Because finding a path of minimum cover is prohibitively expensive, we investigate algorithms that work well in practice and find solutions close to the true minimum cover solution. We introduce the notion of removal importance …
-
A constraint language in C
Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1983.
-
Constraint-System für eine mehrschichtige Metamodellierungsumgebung
… zur Formulierung solcher Randbedingungen (engl. constraints) entwickelt. Diese dienen einerseits dazu, die Modellierungssprache selbst einzuschränken, ermöglichen also den oben erwähnten Wechsel zwischen freien und strikten Modellierungsparadigmen. Andererseits ermöglicht sie eine inhaltliche …
-
Search in weighted constraint satisfaction problems
… problems can be modelled as Weighted Constraint Satisfaction Problems (WCSPs). Such problems are NP-hard and require an exponential amount of time to find the optimal solution. This thesis concentrates on the University Examination Timetabling Problem. A general abstraction of this …
-
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 …
-
Optimizing Infrastructure Resilience under Budgetary Constraint
… of the resilience; and iv) under the budget constraint, an optimal selection of multiple components of a system to minimize the total impact when those components are compromised. The resilience metric (RM) is a quantitative measure that can help evaluate the effectiveness of investments on …
-
Slipping on the strongest surrogate constraint
Includes bibliographical references.
-
Large-Scale Constraint-Based Pattern Mining
We studied the problem of constraint-based pattern mining for three different data formats, item-set, sequence and graph, and focused on mining patterns of large sizes. Colossal patterns in each data formats are studied to discover pruning properties that are useful for direct mining of these …
-
Acquiring minimalist grammars via constraint satisfaction
… a mathematical structure, a Collection of Constraints, that captures the logical constraints, including those that arise as a consequence of the shortest move constraint, imposed upon the syntactic features of lexical items as they are merged together in a derivation produced by a given …
-
Distributed mode estimation through constraint decomposition
… the concept of probabilistic hierarchical constraint automata (PHCA) to compactly model both complex software and hardware behavior. Our method, inspired by this previous work, translates the PHCA model to a constraint representation. This approach handles a more precise initial state …
-
Policy Compilation for Stochastic Constraint Programs
… probabilistic information explicitly as logical constraints, (b) performs temporal reasoning to extract logical temporal conflicts, and (c) compiles out the constraints of a Weighted, Conditional, Stochastic CSP into a compact policy representation which may be efficiently queried. Such an …
Page 1 of 143