Upgraded SemIndex Prototype Supporting Intelligent Database Keyword Queries through Disambiguation, Query as You Type, and Parallel Search Algorithms by Tekli, Joe

Get full text
Get full text
Get full text
Get full text

A Parallel Neural Networks Algorithm for the Clique Partitioning Problem by Harmanani, Haidar M.

“…The clique partitioning problem has important applications in many areas including VLSI design automation, scheduling, and resources allocation. 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

A Neural Networks Algorithm for the Minimum Colouring Problem Using FPGAs† by Harmanani, Haidar

“…The proposed algorithm has a time complexity of O(1) for a neural network with n vertices and k colours. …”
Get full text
Get full text
Get full text

RHEEMix in the data jungle: a cost-based optimizer for cross-platform systems. by Sebastian Kruse (18595195)

PERF solutions for distributed query optimization. (c1999) by Fany, Roula

Get full text
Get full text

Random Forest Bagging and X‐Means Clustered Antipattern Detection from SQL Query Log for Accessing Secure Mobile Data by Rajesh Kumar Dhanaraj (19646269)

“…Experiments are conducted to evaluate the performance of the RFBXSQLQC technique using the IIT Bombay dataset using the metrics like antipattern detection accuracy, time complexity, false-positive rate, and computational overhead with respect to the differing number of queries. The results revealed that the RFBXSQLQC technique outperforms the existing algorithms by 19% with pattern detection accuracy, 34% minimized time complexity, 64% false-positive rate, and 31% in terms of computational overhead.…”

A combined algorithm based on finite elements and a modified methodof characteristics for the analysis of the corona in wire-ductelectrostatic precipitators by Al-Hamouz, Z.M.

Get full text
Get full text

Combining offline and on-the-fly disambiguation to perform semantic-aware XML querying by Tekli, Joe

“…Many efforts have been deployed by the IR community to extend freetext query processing toward semi-structured XML search. …”
Get full text
Get full text
Get full text
Get full text

Full-fledged semantic indexing and querying model designed for seamless integration in legacy RDBMS by Tekli, Joe

“…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

On the Optimization of Band Gaps in Periodic Waveguides by Jamil Renno (14070771)

Subjects: “…Nature-inspired optimization algorithms…”

Extended Behavioral Modeling of FET and Lattice-Mismatched HEMT Devices by Khawam, Yahya Bader

Subjects: Get full text

Sensitivity analysis and genetic algorithm-based shear capacity model for basalt FRC one-way slabs reinforced with BFRP bars by Abathar Al-Hamrani (16494884)

Subjects:

Deep Reinforcement Learning for Resource Constrained HLS Scheduling by Makhoul, Rim

“…The two main steps in HLS are: operations scheduling and data-path allocation. In this work, we present a resource constrained scheduling approach that minimizes latency and subject to resource constraints using a deep Q learning algorithm. …”
Get full text
Get full text
Get full text

Design of adaptive arrays based on element position perturbations by Dawoud, M.M.

“…The authors report on the design of a digital feedback control system to provide null steering by controlling the array element positions automatically. The array comprises a signal processor, digital control algorithm (PID), stepper motors, shaft encoders, actuators and multiplexers. …”
Get full text
Get full text

Adaptive bias simulated evolution algorithm for placement by Youssef, H.

“…A new solution is evolved from current solution by relocating some of the solution elements. Elements with lower goodnesses have higher probabilities of getting selected for perturbation. …”
Get full text
Get full text

An improved kernelization algorithm for r-Set Packing by Abu-Khzam, Faisal N.

“…Such parameterized reductions are known as kernelization algorithms, and a reduced instance is called a problem kernel. …”
Get full text
Get full text
Get full text

A kernelization algorithm for d-Hitting Set by Abu-Khzam, Faisal N.

“…For a given parameterized problem, π, a kernelization algorithm is a polynomial-time pre-processing procedure that transforms an arbitrary instance of π into an equivalent one whose size depends only on the input parameter(s). …”
Get full text
Get full text
Get full text

An exact and general model order reduction technique for the finite element solution of elastohydrodynamic lubrication problems by Habchi, W.

“…This work presents an exact and general model order reduction (MOR) technique for a fast finite element resolution of elastohydrodynamic lubrication (EHL) problems. …”
Get full text
Get full text
Get full text
Get full text

Fuzzy simulated evolution algorithm for topology design of campusnetworks by Youssef, H.

“…The two main phases of the algorithm, namely, evaluation and allocation, have been fuzzified. …”
Get full text
Get full text

Block constrained pressure residual preconditioning for two-phase flow in porous media by mixed hybrid finite elements by Stefano Nardean (14151900)

“…Therefore, we designed a dedicated two-stage strategy, inspired by the CPR algorithm, where a block preconditioner is used for the pressure part with the aim at exploiting the inner $$2\times 2$$ 2 × 2 structure. …”