A clustering-based algorithm for the rectilinear steiner tree problem حسب Karimjee, Yousuali Karim

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

Improved search-tree algorithms for the cluster edit problem. (c2011) حسب Ghrayeb, Ali Kassem

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

An Intensive and Comprehensive Overview of JAYA Algorithm, its Versions and Applications حسب Abu Zitar, Raed

"…The various applications tackled using relevant versions of JAYA algorithm are also discussed and summarized based on several problem domains. …"
احصل على النص الكامل

Highly scalable parallel search-tree algorithms حسب Abu-Khzam, Faisal N.

"…We introduce the notion of a virtual topology and explore the use of search-tree indexing to achieve highly scalable parallel search-tree algorithms for NP-hard problems. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Mapping realistic data sets on parallel computers حسب Mansour, N.

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

The buffered work-pool approach for search-tree based optimization algorithms حسب Abu-Khzam, Faisal N.

"…This new trend has been motivated by hardness of approximation results that appeared in the last decade, and has taken a great boost by the emergence of parameterized complexity theory. Exact algorithms often follow the classical search-tree based recursive backtracking strategy. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Automatic keyword extraction from a real estate classifieds data set حسب Devassy, Dibin

"…Keywords are considered to be a solution to this problem and are now widely used to search the information over the internet.In this project we analyze a real estate classifieds data set, with an objective to find keywords that represent this data set. …"
احصل على النص الكامل

Matheuristic Fixed Set Search Applied to the Two-Stage Capacitated Facility Location Problem حسب Denis Alicic (23073484)

Data reductions and combinatorial bounds for improved approximation algorithms حسب Abu-Khzam, Faisal N.

"…Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of data reduction rules and combinatorial insights. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Allocating data to distributed-memory multiprocessors by genetic algorithms حسب Mansour, Nashat

"…We present three genetic algorithms (GAs) for allocating irregular data sets to multiprocessors. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Variable Selection in Data Analysis: A Synthetic Data Toolkit حسب Mitra, Rohan

"…Variable (feature) selection plays an important role in data analysis and mathematical modeling. This paper aims to address the significant lack of formal evaluation benchmarks for feature selection algorithms (FSAs). …"
احصل على النص الكامل

Efficient Dynamic Cost Scheduling Algorithm for Data Batch Processing حسب Al Sadawi, Alia

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

Physical optimization algorithms for mapping data to distributed-memory multiprocessors حسب Mansour, Nashat

"…We also present a technique for efficient mapping of large data sets. The algorithms include a parallel genetic algorithm (PGA), a parallel neural network algorithm (PNN) and a parallel simulated annealing algorithm (PSA). …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Hardening the ElGamal cryptosystem in the setting of the second group of units. (c2011) حسب Fanous, Suzan Mohamad

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

DG-Means – A Superior Greedy Algorithm for Clustering Distributed Data حسب Assaf, Ali

"…In this work, we present DG-means, which is a greedy algorithm that performs on distributed sets of data. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Efficient Dynamic Cost Scheduling Algorithm for Financial Data Supply Chain حسب Al Sadawi, Alia

"…This work investigates the problem of scheduling the processing of tasks with non-identical sizes and different priorities on a set of parallel processors. An iterative dynamic scheduling algorithm (DCSDBP) was developed to address the data batching process. …"
احصل على النص الكامل

On the steiner walk problem. (c2009) حسب Maarouf, Amina

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

Adaptive Secure Pipeline for Attacks Detection in Networks with set of Distribution Hosts حسب ALSHAMSI, SUROUR

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

A multi-class discriminative motif finding algorithm for autosomal genomic data. (c2015) حسب Wehbe, Gioia Wahib

"…Additionally, it was able to identify several differentiable regions in the real data set and on different chromosomes. However, we noticed that chromosomes 1, 3 and 6 had the highest occurrence rate of differentiable motifs (9, 8 and 6 motifs respectively). …"
احصل على النص الكامل
احصل على النص الكامل

Efficient Approximate Conformance Checking Using Trie Data Structures حسب Awad, Ahmed

"…By encoding the proxy behavior using a trie data structure, we obtain a logarithmically reduced search space for alignment computation compared to a set-based representation. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل