-
1
-
2
Information reconciliation through agent controlled graph model. (c2018)
Published 2018“…Our approach provides a damage assessment and recovery algorithm that is based on agents and graphs.…”
Get full text
Get full text
Get full text
masterThesis -
3
Machine Learning-Driven Prediction of Corrosion Inhibitor Efficiency: Emerging Algorithms, Challenges, and Future Outlooks
Published 2025“…At the same time, virtual sample augmentation and genetic algorithm feature selection elevate sparse data performance, raising k-nearest neighbor models from R<sup>2</sup> = 0.05 to 0.99 in a representative thiophene set. …”
-
4
-
5
A Cyber-Physical System and Graph-Based Approach for Transportation Management in Smart Cities
Published 2021“…The system makes use of travel-time, traffic intensity, vehicle’s speed, and current road conditions to construct a weighted city graph representing the road network. Traditional graph algorithms with efficient implementation technologies are employed to respond to commuters’ and authorities’ needs in order to achieve a smart and optimum transportation system. …”
-
6
-
7
Physical optimization algorithms for mapping data to distributed-memory multiprocessors
Published 1992“…The technique proposed for large problems is based on a pre-mapping graph contraction heuristic algorithm, which results in a smaller search space. …”
Get full text
Get full text
Get full text
masterThesis -
8
Eye-Clustering: An Enhanced Centroids Prediction for K-means Algorithm
Published 2024“…Hundreds of such labeled graphs were used to train the model to predict the location of centroids. …”
Get full text
Get full text
Get full text
masterThesis -
9
A method for the minimum coloring problem using genetic algorithms
Published 2006Get full text
Get full text
Get full text
conferenceObject -
10
A Parallel Neural Networks Algorithm for the Clique Partitioning Problem
Published 2002“…In this paper we present a parallel algorithm to solve the above problem for arbitrary graphs using a Hopfield Neural Network model of computation. …”
Get full text
Get full text
article -
11
Correlation Clustering with Overlaps
Published 2020Get full text
Get full text
Get full text
masterThesis -
12
An Effective Hash Based Assessment and Recovery Algorithm for Healthcare Systems
Published 2019“…Finally, the experimental results prove the improvements provided by our hash based algorithm over previously suggested models.…”
Get full text
Get full text
Get full text
masterThesis -
13
A Neural Networks Algorithm for the Minimum Colouring Problem Using FPGAs†
Published 2010“…This paper presents a hardware implementation to solve the graph colouring problem (chromatic number χ(G)) for arbitrary graphs using the Hopfield neural network (HNN) model of computation. …”
Get full text
Get full text
Get full text
article -
14
Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks
Published 2018“…These networks have non-uniform transmission ranges and are modeled using directed disk graphs. The corresponding graph theoretic problem seeks a strongly connected dominating-absorbent set of minimum cardinality in a digraph. …”
Get full text
Get full text
Get full text
Get full text
article -
15
Correlation Clustering via s-Club Cluster Edge Deletion
Published 2023“…In certain situations, the requirement for clusters to be cliques was deemed excessively stringent, leading to the proposal of alternative relaxed clique models for dense subgraphs, such as s-club. In this work, we implement three approaches to tackle the 2-club clustering via edge deletion: a heuristic approach based on the influence of the edge to resolve maximum conflicts, a parameterized algorithm in which by deleting a maximum of k edges, the graph can be transformed into a 2-club cluster based on a branching algorithm, and the approach in Integer Linear Programming to find the optimized solution in an integer formulation. …”
Get full text
Get full text
Get full text
masterThesis -
16
-
17
Optimum Partition of Power Networks Using Singular Value Decomposition and Affinity Propagation
Published 2024“…From this perspective, this paper proposes an efficient framework for fast and optimal PGP, based on singular value decomposition analysis of the graph's Laplacian. An Affinity Propagation clustering algorithm-based PGP is tailored for automatically forming highly interconnected clusters based on pairwise similarities without requiring a predefined number of partitions. …”
-
18
Full-fledged semantic indexing and querying model designed for seamless integration in legacy RDBMS
Published 2018“…We then provide a general keyword query model with specially tailored query processing algorithms built on top of SemIndex, in order to produce semantic-aware results, allowing the user to choose the results' semantic coverage and expressiveness based on her needs. …”
Get full text
Get full text
Get full text
Get full text
article -
19
Degree-Based Network Anonymization
Published 2020“…In this thesis, we study a new multi- objective parameterized anonymization approach that generalizes the known degree anonymization problem and attempts at improving it as a more realistic model for data security/privacy. Our model suggests a convenient privacy level for each net- work based on the standard deviation of its degrees. …”
Get full text
Get full text
Get full text
masterThesis -
20
A simple approach for testing web service based applications
Published 2005“…In our technique, a web application and its composed components are specified by a two-level abstract model. The web application is represented as Task Precedence Graph (TPG) and the behavior of the composed components is represented as a Timed Labeled Transition System (TLTS). …”
Get full text
Get full text
Get full text
Get full text
conferenceObject
