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 11 of 11 for “"Branch and Bound Search"”.
-
A high-level approach to test generation for VLSI circuits
… approach has been designed on the basis of the branch and bound search procedure. This approach contains a data path test generator and a control circuit test generator.
-
Methods and applications in computational protein design
… thesis, we summarize our work on applications and methods for computational protein design. First, we apply computational protein design to address the problem of degradation in stored proteins. Specifically, we target cysteine, asparagine, glutamine, and methionine amino acid residues to …
-
Rapid Prototyping Job Scheduling Optimization
… rely on human intervention to load and unload build jobs. Hence, jobs are processed subject to both the machine's and the operator's schedules. In particular, first-in-first-out (FIFO) queuing of such systems will result in machine idle time whenever a build job has been completed …
-
3D model-based pose estimation of rigid objects from a single image for robotics
… assume that we are operating with RGB-D images and some information about the pose of the camera. We also assume that a 3D mesh model of the object is available, along with a small number of labeled images of the object. The problem is motivated by robot systems operating in indoor environments …
-
Modeling audio and visual cues for real-world event detection
… focused on restricted highlight events, and depended on highly ad-hoc detectors for these events. This research emphasizes generalizable robust modeling of single-microphone audio cues and/or single-camera visual cues for the detection of real-world events, requiring no expensive …
-
Caracterización de los modelos de búsqueda de un agente con descripciones generalizadas de los nodos origen y destino
… satisfechas. ABSTRACT Single-agent search algorithms are, at first, a very useful technique for constructing intelligent systems. However, their study has been severely restricted to a few very well-defined domains and, in general terms, there is not a comprehensive description of …
-
Towards GPU-accelerated discrete optimization
… a wide range of applications in operations research. These problems often involve selecting an optimal subset or sequence of decisions from a finite set, a task that becomes exponentially harder as the problem size grows. While traditional computing approaches are powerful, they often struggle …
-
Human-machine collaborative optimization via apprenticeship scheduling
… abilities, they lack the ability to anticipate and adapt to the needs of their human teammates. I believe robots must be capable of autonomously learning from humans how to integrate into a team ' la a human apprentice. Human domain experts and professionals become experts over years of …
-
Search State Extensibility based Learning Framework for Model Checking and Test Generation
The increasing design complexity and shrinking feature size of hardware designs have created resource intensive design verification and manufacturing test phases in the product life-cycle of a digital system. On the contrary, time-to-market constraints require faster verification and test phases; …
-
Alignment, Clustering and Extraction of Structured Motifs in DNA Promoter Sequences
… short DNA sequence found in the promoter region and believed to act as a binding site for a transcription factor protein. A structured motif is a sequence of simple motifs (boxes) separated by short sequences (gaps). Biologists theorize that the presence of these motifs play a key role in gene …
-
Cyclic best first search in branch-and-bound algorithms
… this dissertation, we study the application of a search strategy called cyclic best first search (CBFS) in branch-and-bound (B&B) algorithms. First, we solve a one machine scheduling problem with release and delivery times with the minimum makespan objective with a B&B algorithm using a variant of …