Two-level models of recognition algorithms
β Scribed by V.V. Krasnoproshin; V.A. Obraztsov
- Publisher
- Elsevier Science
- Year
- 1985
- Weight
- 602 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0041-5553
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this article, we simulate and evaluate various Twolevel Scheduling algorithms for cluster-based NUMA (Non-Uniform Memory Access) multiprocessors. Twolevel Scheduling is a kind of space partitioning scheduling. We evaluate the following variations: (1) Cluster-free Algorithm and (2) Cluster-limite
Although many networks have been proposed as the topology of a large-scale parallel and distributed system, most of them are neither expansible nor of equal degree. A network with these two properties will gain the advantages of easy implementation and low cost when it is manufactured. The hypernet,
In this paper we use the multigrid algorithm -commonly used to improve the efficiency of the flow solver -to improve the efficiency of partitioned fluid-structure interaction iterations. Coupling not only the structure with the fine flow mesh, but also with the coarse flow mesh (often present due to