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 83 for “"hard problem"”.
-
The use of dynamic networks in scheduling flexible manufacturing systems
… companies to compete in a global market. One problem arising from such systems is the optimal scheduling of the jobs through the system. There is much discussion as to what this problem should be, but it is agreed that it is a hard problem.
-
Load volume considerations in the collision free route planning of material handling devices in FMS
… AGVs to avoid collision is known to be an NP-Hard problem. In this research, we address the problem of optimal and efficient routing of AGVs through a guide path network.
-
Visualization of Surfaces and 3D Vector Fields
… components in scientific computation is still a hard problem in compute graphic area. People build their own visualization packages for their special purposes. And there exist some general-purpose packages (MatLab, Vis5D), but they all require extensive user experience on setting all the …
-
Approaches for solving some scheduling and routing problems
… for three difficult combinatorial optimisation problems.<br/>The supply ship travelling salesman problem is a simplification of a situation faced by a naval logistics coordinator who must direct a support vessel tasked with resupplying ships in a fleet. It is a generalisation of the travelling …
-
Conformance Testing and Error Explanation for Software Models
… effort to characterize the complexity of the problem. Because this is a vital part of any verification endeavor, we analyze the complexity of the most popular error explanation heuristics as a function of the program model. We establish the hardness of error explanation according to one …
-
Force Feedback for Reliable Robotic Door Opening
Opening a door is still a hard problem in robotics. Many robotic manipulators use open-loop position control to open doors, which reduces reusability and reliability in the face of slight differences or sensor errors. Many others use force feedback or impedance control but skip past the problem of …
-
On basing private information retrieval on NP-hardness
… conjectures, there are no reductions from an NP-hard problem to the task of breaking certain cryptographic schemes. We make progress along this line of inquiry by showing that the security of single-server single-round private information retrieval schemes cannot be based on NP-hardness, unless …
-
Essence Apparatus
… two sisters, and lovers. The stories explore the hard problem of consciousness and other philosophical questions; the search for knowledge and a feeling of belonging in a nature not fully understood, and the mechanisms of translocation and transfiguration as a fundamental part of being human.
-
Pigeonhole Equal Subset Sum in O ⃰ (2ⁿ/³)
Subset Sum is a well known NP-hard problem. In Subset Sum, we are given a set of n integers S = {a1,··· ,an} and a target integer t, and are asked to find a subset A ⊆ [n] such that [formula]. We study a variant of the Subset Sum problem, Pigeonhole Equal Subset Sum. In Pigeonhole Equal Subset Sum, …
-
Aspects of strongly-coupled field theory from gauge-gravity duality
The issue of calculating at strong coupling is a hard problem in physics. The discovery of gauge-gravity duality at the end of the Twentieth Century provides a novel means of calculating in a large-N gauge theory at strong coupling. In this thesis we apply the method of gauge-gravity duality to a …
-
Coding Techniques for Linear Block Codes With Applications to Fault Identification
… Since ML soft-decision decoding is an NP-hard problem, we concentrate our efforts on exploring computationally efficient suboptimal soft-decision decoding methods, based on iterative recoding, a methodology that attempts to systematically search through reliable information (basis) bits …
-
Polynomial time optimal algorithm for stencil row planning in e-beam lithography
… However, the top-level 2D stencil planning problem has been proven to be an NP-hard problem. As its most essential step, the 1D row ordering is believed hard as well, and no polynomial time optimal solution has been provided so far. Previous research formulates the problem as the travelling …
-
Analogical representation in temporal, spatial, and mnemonic reasoning
The traditional Euclidean approach to problem solving in AI has always designed representations for a domain and then spent considerable effort on the methods of efficiently searching the representation in order to extract the desired information. We feel that the emphasis in problem solving should …
-
On the Breadth of the Jones Polynomial for Certain Classes of Knots and Links
The problem of finding the crossing number of an arbitrary knot or link is a hard problem in general. Only for very special classes of knots and links can we solve this problem. Often we can only hope to find a lower bound on the crossing number Cr(K) of a knot or a link K by computing the Jones …
-
On Training Neurons with Bounded Compilations
… Ordered Binary Decision Diagram (OBDD), is an NP-hard problem. In this thesis, we consider the problem of training a neuron from data, subject to the constraint that it has a compact representation as an OBDD. Our approach is based on the observation that a neuron can be compiled into an OBDD in …
-
Automated analysis of musical structure
… models to mimic these processes is a hard problem. Furthermore, the amount of digital music that has been generated and stored has already become unfathomable. How to efficiently store and retrieve the digital content is an important real-world problem. This dissertation presents our …
-
Firewall Policy Optimization and Management
… is equivalent to job-shop scheduling, a known NP-Hard problem. The sorting techniques are novel in that they consider sub-graphs of rules (inter-related by precedence constraints) and compare the advantage of placing and merging the nodes that comprise them. For policy management, a shadow …
-
How do developers use parallel libraries?
Parallel programming is hard. The industry leaders hope to convert the hard problem of using parallelism into the easier problem of using a parallel library. Yet, we know little about how programmers adopt these libraries in practice. Without such knowledge, other programmers cannot educate …
-
Image statistics and the perception of surface reflectance
… unknown illumination from a single image is a hard problem. Recent work in reflectance recognition has shown that certain statistics measured o an image of a surface are diagnostic of reflectance. We consider opaque surfaces with medium scale structure and spatially homogeneous reflectance …
-
Application of Network Reliability to Analyze Diffusive Processes on Graph Dynamical Systems
… in evaluating the exact network reliability, the problem has been classified as a NP-hard problem. The estimation of the reliability polynomials for large graphs is feasible using Monte Carlo simulations. However, the number of samples required for an accurate estimate increases with system size. …
Page 1 of 5