Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
A survey of current challenges in partitioning and processing of graph-structured data in parallel and distributed systems
One of the concepts that attracts attention since entering of big data era is the graph-
structured data. Suitable frameworks to handle such data would face several constraints …
structured data. Suitable frameworks to handle such data would face several constraints …
Genetic approaches for graph partitioning: a survey
The graph partitioning problem occurs in numerous applications such as circuit placement,
matrix factorization, load balancing, and community detection. For this problem, genetic …
matrix factorization, load balancing, and community detection. For this problem, genetic …
Automatic package coupling and cycle minimization
Object-oriented (OO) software is usually organized into subsystems using the concepts of
package or module. Such modular structure helps applications to evolve when facing new …
package or module. Such modular structure helps applications to evolve when facing new …
[KNIHA][B] Large scale and big data: Processing and management
This book provides a central source of reference on the various data management
techniques of large scale data processing and its technology application. This book presents …
techniques of large scale data processing and its technology application. This book presents …
A novel optimization model for designing compact, balanced, and contiguous healthcare districts
In this study, we propose a new multi-objective mathematical model for designing compact,
balanced, and contiguous districts in healthcare systems. The objective functions minimize …
balanced, and contiguous districts in healthcare systems. The objective functions minimize …
Parallel incremental graph partitioning
CW Ou, S Ranka - IEEE transactions on Parallel and …, 1997 - ieeexplore.ieee.org
Partitioning graphs into equally large groups of nodes while minimizing the number of edges
between different groups is an extremely important problem in parallel computing. For …
between different groups is an extremely important problem in parallel computing. For …
HUB-GA: A heuristic for universal lists broadcasting using genetic algorithm
S Gholami, HA Harutyunyan - Journal of Communications and …, 2023 - ieeexplore.ieee.org
Broadcasting is a fundamental problem in the information dissemination area. In classical
broadcasting, a message must be sent from one network member to all other members as …
broadcasting, a message must be sent from one network member to all other members as …
Scalable parallel genetic algorithms
W Rivera - Artificial intelligence review, 2001 - Springer
Genetic algorithms, search algorithms based on the genetic processes observed in natural
evolution, have been used to solve difficult problems in many different disciplines. When …
evolution, have been used to solve difficult problems in many different disciplines. When …
Opportunity cost algorithms for reduction of I/O and interprocess communication overhead in a computing cluster
A Keren, A Barak - IEEE Transactions on Parallel and …, 2003 - ieeexplore.ieee.org
Computing clusters (CC) consisting of several connected machines, could provide a high-
performance, multiuser, timesharing environment for executing parallel and sequential jobs …
performance, multiuser, timesharing environment for executing parallel and sequential jobs …
Cost-optimizing allocation system and method
DE Joslin, DP Clements - US Patent 6,272,483, 2001 - Google Patents
(57) ABSTRACT A System for determining Schedules and processing other optimization
problems includes a local optimization engine and a global optimization engine. The local …
problems includes a local optimization engine and a global optimization engine. The local …