A LINEAR-PROGRAMMING APPROACH FOR THE WEIGHTED GRAPH MATCHING PROBLEM حسب Al-Mohamad, HA

"…The complexity of the proposed algorithm is polynomial time, and it is O(n6 L) for matching graphs of size n. …"
احصل على النص الكامل

Maximal clique enumeration. (c2007) حسب Barghout, Hamed

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

A linear programming approach for the weighted graph matchingproblem حسب Almohamad, H.A.

"…The complexity of the proposed algorithm is polynomial time, and it is O(n 6L) for matching graphs of size n. …"
احصل على النص الكامل
احصل على النص الكامل

A simulated evolution approach to task-matching and scheduling in heterogeneous computing environments حسب Barada, Hassan

"…Workloads are characterized according to the connectivity, heterogeneity, and communication-to-cost ratio of the task graphs representing the application tasks. The performance of SE is compared with a genetic algorithm approach for the same problem with respect to the quality of solutions generated, and timing requirements of the algorithms. r 2003 Elsevier Science Ltd. …"
احصل على النص الكامل

Modular-width حسب Abu-Khzam, Faisal N.

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

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

"…., considering the lexical and semantic similarities/disparities when matching user query and data index terms. To do so, we design and construct a semantic-aware inverted index structure called SemIndex, extending the standard inverted index by constructing a tightly coupled inverted index graph that combines two main resources: a semantic network and a standard inverted index on a collection of textual data. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل