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 6 of 6 for “"Graph pruning"”.
-
Multi-Agent Narrative Experience Management as Story Graph Pruning
… intelligent interactive narratives through story graph representation and pruning. The space of all stories can be represented as a story graph where nodes are states and edges are actions. By shaping the domain as a story graph, experience manager decisions can be made by pruning edges. Starting …
-
A Multi-Objective Ant Colony Optimization Algorithm for Infrastructure Routing
… The algorithm proposes unique functions such as graph pruning and path straightening to enhance both speed and performance. It also possesses features to solve issues unique to infrastructure routing not found in existing MOACO algorithms, such as problems with multiple end points or multiple …
-
Leveraging external information for Enhancing provenance-based cybersecurity
… representation of system execution, provenance graphs (PGs) are widely used to identify malicious activities and reconstruct attack scenarios in tasks such as attack detection and forensic analysis. However, the massive volume of monitoring data results in highly complex graphs with extensive …
-
Learning from SOM Voronoi Tessellations: Applications to Density Estimation and Clustering
… Coordinate Smoothing), exploits both the CADJ graph of SOM prototypes and the geometries of the Voronoi regions it connects; this helps VECS avoid the computational issues stemming from minimization of the traditional error functionals used in density estimation, making it suitable for use in …
-
Algorithmic Distribution of Applied Learning on Big Data
Machine Learning and Graph techniques are complex and challenging to distribute. Generally, they are distributed by modeling the problem in a similar way as single node sequential techniques except applied on smaller chunks of data and compute and the results combined. These techniques focus on …
-
Αποδοτικές μέθοδοι κινητικότητας σε σύγχρονα συγκοινωνιακά δίκτυα
… alternative paths is created and then a "pruning" phase in which the computed set gets reduced by removing sub-paths using time-dependent variants of the classic plateau and penalty methods and a path quality rating process. During the execution of the aforesaid phases, the processing and …