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 8 of 8 for “"Path Pruning"”.
-
Stigmergy-Based Multi-Agent Motion Planning Using QR Codes
… planning, it introduces a framework for encoding paths within QR codes that are physically placed in the environment. Feasible paths generated by a robot are post-processed through path pruning and ellipsoidal containers to reduce data size while preserving essential trajectory information. QR …
-
Τεχνικές κωδικοποίησης καναλιού με έμφαση στους συγκεραστικούς και στους τούρμπο κώδικες
… codes, by combining the techniques of path pruning and puncturing. The new codes can vary their rate, as well as the complexity of their trellis diagram, and hence the computational complexity of the decoding algorithm, leading to coding schemes that manage more efficiently the system …
-
Tournament on Path: Relation Abstraction and Ranking for Knowledge Graph Reasoning
… inherent limitations, including locally scoped pruning, unstable pointwise scoring, and the indiscriminate discarding of valuable candidates through random sampling. To address these challenges, this thesis introduces Tournament on Path (ToP), a novel reasoning framework that enhances relation …
-
Fault modeling, delay evaluation and path selection for delay test under process variation in nano-scale VLSI circuits
… fault modeling, variational delay evaluation and path selection under process variation. Previous research of fault modeling on resistive spot defects, such as resistive opens and bridges in the interconnect, and resistive shorts in devices, lacked an accurate fault model. As a result it was …
-
Energy efficient geographic routing for wireless sensor networks.
… geographic routing. This framework includes a path pruning strategy by exploiting the channel listening capability, an anchor-based routing protocol using anchors to act as relay nodes between source and destination, a geographic multicast algorithm clustering destinations that can share the …
-
Improved Path Recovery in Pseudo Functional Path Delay Test Using Extended Value Algebra
… This is particularly important for our K Longest Paths Per Gate (KLPG) test approach, which has additional necessary assignments on the paths. At the same time, some percentage of the flip-flops in the circuit will not scan, increasing the difficulty in test generation. In particular, there is no …
-
Analysis and optimization of digital circuit dynamic behavior
… VLSI circuit throughput. In this thesis, path constraint tuning (PCT) is proposed to design high-throughput processor components. PCT leverages a commercial design flow to tightly constrain frequently exercised timing paths and relax the infrequently exercised portion of the design. PCT is …
-
DASE: Document-Assisted Symbolic Execution for Improving Automated Test Generation
… The input constraints are then used as pruning criteria; inputs far from being valid are trimmed off. In this way, DASE guides symbolic execution to focus on those inputs that are semantically more important. We evaluated DASE on 88 programs from 5 mature real-world software suites: GNU …