A Highly Efficient And Automated Approach To Identifying And Classifying Urban Traffic Images Using Self Organizing Maps and Artificial Intelligence. (c2006) حسب Bey, Hisham Mardam

احصل على النص الكامل
احصل على النص الكامل

Deep Reinforcement Learning for Resource Constrained HLS Scheduling حسب 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

FESP. (c1995) حسب Haidar, Kamal

احصل على النص الكامل
احصل على النص الكامل

The Use of Microwave Tomography in Bone Healing Monitoring حسب Alkhodari, Mohanad Ahmed

احصل على النص الكامل

Design of acoustic absorbing metasurfaces using a data-driven approach حسب Hamza Baali (14603380)

الموضوعات:

ELISSAR. (c1997) حسب Nasreddine, Diana M.

احصل على النص الكامل
احصل على النص الكامل

Energy-Aware Qos Scheduling at Mac Level in Wimax حسب Al Nourani , Sanabel

احصل على النص الكامل

Virtualizing and Scheduling FPGA Resources in Cloud Computing Datacenters حسب Farhan, Abid

احصل على النص الكامل

A Fuzzy Low-Dimensional Intersection Graph Representation Approach for Graph Compression and Anonymization حسب Yamout, Youssef

احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

A Novel Fault Diagnosis of Uncertain Systems Based on Interval Gaussian Process Regression: Application to Wind Energy Conversion Systems حسب Majdi Mansouri (16869885)

A method for the minimum coloring problem using genetic algorithms حسب Harmanani, Haidar

"…This paper presents a method to solve the graph coloring problem for arbitrary graphs using genetic algorithms. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

A Parallel Neural Networks Algorithm for the Clique Partitioning Problem حسب 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. …"
احصل على النص الكامل
احصل على النص الكامل

Degree-Based Network Anonymization حسب Halawi, Ola

احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Design of adaptive arrays based on element position perturbations حسب Dawoud, M.M.

"…The main advantage of using this technique over the other commonly used methods is that the amplitudes and phases of the array elements can be used mainly to steer the main beam towards the desired signal. …"
احصل على النص الكامل
احصل على النص الكامل

Scheduling and allocation in high-level synthesis using stochastic techniques حسب Sait, Sadiq M.

"…In this work, a unique approach to scheduling and allocation problem using the genetic algorithm (GA) is described. …"
احصل على النص الكامل

A Simulated Annealing Algorithm For Fuzzy Unit Commitment Problem حسب Mantawy, A. H.

"…A simple cooling schedule has been implemented to apply the simulated annealing test in the algorithm. …"
احصل على النص الكامل

A simulated annealing algorithm for fuzzy unit commitment problem حسب Mantawy, A.H.

"…A simple cooling schedule has been implemented to apply the simulated annealing test in the algorithm. …"
احصل على النص الكامل
احصل على النص الكامل

Dynamic Spectrum Scheduling and Management in Centralized Cognitive Radio Networks حسب Sweileh, Omar Khalid

احصل على النص الكامل

Machine learning based approaches for intelligent adaptation and prediction in banking business processes. (c2018) حسب Tay, Bilal M.

"…Companies, nowadays, rely on systems and applications to automate their business processes and data management. In this context, the notion of integrating machine learning techniques in banking business processes has emerged, where trainable computational algorithms can be improved by learning. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

A Neural Networks Algorithm for the Minimum Colouring Problem Using FPGAs† حسب Harmanani, Haidar

"…The proposed algorithm has a time complexity of O(1) for a neural network with n vertices and k colours. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل