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

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

A decentralized load balancing strategy for parallel search-three optimization. (c2010) حسب Mouawad, Amer E.

الموضوعات: "…Trees (Graph theory) -- Data processing…"
احصل على النص الكامل
احصل على النص الكامل

A parallel search tree algorithm for vertex cover on graphical processing units. (c2013) حسب Kabbara, Rashad Karim

الموضوعات: "…Trees (Graph theory) -- Data processing…"
احصل على النص الكامل
احصل على النص الكامل

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

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

Genetic and heuristic algorithms for regrouping service sites. (c2000) حسب Tabbara, Hiba

الموضوعات: "…Genetic algorithms -- Data processing…"
احصل على النص الكامل
احصل على النص الكامل

A genetic algorithm for corrective retesting. (c1995) حسب Fakih, Khaled A.

الموضوعات: احصل على النص الكامل
احصل على النص الكامل

Three-phase approach for curriculum-based course timetabling problem. (c2012) حسب Jazzar, Hanaa Salem El-

الموضوعات: "…Scheduling -- Data processing…"
احصل على النص الكامل
احصل على النص الكامل

Bird’s Eye View feature selection for high-dimensional data حسب Samir Brahim Belhaouari (16855434)

"…BEV incorporates elements of Evolutionary Algorithms with a Genetic Algorithm to maintain a population of top-performing agents, Dynamic Markov Chain to steer the movement of agents in the search space, and Reinforcement Learning to reward and penalize agents based on their progress. …"

A Tabu Search algorithm for mapping data to multicomputers. (c1997) حسب Diab, Kamal M.

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

A fast exact sequential algorithm for the partial digest problem حسب Mostafa M. Abbas (17058093)

"…Two types of simulated data, random and Zhang, are used to measure the efficiency of the algorithm. …"

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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

A Multiswarm Intelligence Algorithm for Expensive Bound Constrained Optimization Problems حسب Wali Khan Mashwani (14590504)

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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

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

"…A Master of Science thesis in Engineering Systems Management by Alia Al Sadawi entitled, "Efficient Dynamic Cost Scheduling Algorithm for Data Batch Process," submitted in May 2016. …"
احصل على النص الكامل

Augmented arithmetic optimization algorithm using opposite-based learning and lévy flight distribution for global optimization and data clustering حسب Abu Zitar, Raed

"…This paper proposes a new data clustering method using the advantages of metaheuristic (MH) optimization algorithms. …"

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

"…An iterative dynamic scheduling algorithm (DCSDBP) was developed to address the data batching process. …"
احصل على النص الكامل

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

الموضوعات: "…Euclidean algorithm -- Data processing…"
احصل على النص الكامل
احصل على النص الكامل

Stochastic Search Algorithms for Exam Scheduling حسب Mansour, Nashat

"…In this work, we use a modified weighted-graph coloring problem formulation and adapt two stochastic search algorithms for solving the problem. The two algorithms are a simulated annealing algorithm (SA) and a genetic algorithm (GA). …"
احصل على النص الكامل
احصل على النص الكامل

Sensitivity to parameters and general applicability of genetic algorithms and simulated annealing algorithms for mapping data to multicomputers. (c1994) حسب Kawash, Jalal Y.

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

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

الموضوعات: احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل