Results 1 to 10 of about 113,652 (316)
Blocked Two-Level Regular Designs with Individual Aliased Effect Number Pattern [PDF]
This paper proposes a blocked individual aliased effect number pattern (BI-AENP) for regular blocked designs and establishes its relationships with the core patterns of several existing optimality criteria. We develop an algorithm to compute the BI-AENP.
Min Han, Shengli Zhao, Tao Sun
doaj +2 more sources
Solving V2X Blocking Algorithm
Yongdong Li +14 more
openaire +2 more sources
Tuning block-parallel all-pairs shortest path algorithm for efficient multi-core implementation
Finding shortest paths in a weighted graph is one of the key problems in computer-science, which has numerous practical applications in multiple domains.
O. N. Karasik, A. A. Prihozhy
doaj +1 more source
Objectives. The problem of parallelizing computations on multicore systems is considered. On the Floyd – Warshall blocked algorithm of shortest paths search in dense graphs of large size, two types of parallelism are compared: fork-join and network ...
A. A. Prihozhy
doaj +1 more source
General block lms algorithm [PDF]
In this paper, we analyze the conventional block-least-mean-square (BLMS) algorithm. Usual constraints such as real input data, steady-state analysis and positive adaptive step-size parameter are discarded. Some modifications are introduced in order that the new complex frequency-domain BLMS algorithm equals the former versions in case any of the ...
Domínguez Jiménez, María Elena +2 more
openaire +2 more sources
Partial-Failure Segregated Spectrum Assignment for Multicast Traffic in Flex-Grid Optical Networks
In this paper, we propose a new algorithm called the partial-failure segregated multicasting routing and spectrum assignment (PFS MRSA) algorithm to improve the service blocking performance of the multicast transmission in flex-grid optical networks ...
Yang Qiu
doaj +1 more source
Adaptive block coordinate DIRECT algorithm [PDF]
DIviding RECTangles (DIRECT) is an efficient and popular method in dealing with bound constrained optimization problems. However, DIRECT suffers from dimension curse, since its computational complexity soars when dimension increases. Besides, DIRECT also converges slowly when the objective function is flat. In this paper, we propose a coordinate DIRECT
Tao, Qinghua +3 more
openaire +3 more sources
Generalized blocked Floyd – Warshall algorithm
One of the most commonly used on practice all-pairs shortest paths algorithms on weighted graphs is Floyd – Warshall algorithm. Blocked version serves as a basis for obtaining effective parallel algorithms to be implemented on multicore central ...
Nikolai A. Likhoded
doaj +1 more source
Research on pedestrian detection algorithm in driverless urban traffic environment [PDF]
Pedestrian detection in urban traffic environment is an important field of driverless vehicle research. Due to the variability of traffic flow, target detection algorithm cannot extract complete feature information, which brings great challenges to ...
Liu Xinchao, Yan Ying, Gan Haiyun
doaj +1 more source
HETEROGENIOUS BLOCKED ALL-PAIRS SHORTEST PATHS ALGORITHM
The problem of finding the shortest paths between all pairs of vertices in a weighted directed graph is considered. The algorithms of Dijkstra and Floyd-Warshall, homogeneous block and parallel algorithms and other algorithms of solving this problem are ...
A. A. Prihozhy, O. N. Karasik
doaj +1 more source

