Results 71 to 80 of about 4,693,176 (171)

Level Based Routing Using Dynamic Programming for 2D Mesh

Cybernetics and Information Technologies, 2017
The performance of the interconnection network doesn’t only depend on the topology, but it also depends on the Routing algorithm used. The simplest Routing algorithm for the mesh topology in networks on chip is the XY Routing algorithm.
Punhani Akash, Kumar Pardeep, Nitin Nitin   +2 more
doaj   +1 more source

New related-key rectangle attack on 42-round SHACAL-2

Tongxin xuebao, 2009
A new 34-round related-key rectangle distinguisher was constructed by exploiting the properties of the round transform of SHACAL-2. Moreover, two new relate-key rectangle attacks on 40-round and 42-round reduced SHACAL-2 were presented by using both the ...
WEI Yong-zhuang1, 2
doaj  

Maximum entropy searching

CAAI Transactions on Intelligence Technology, 2018
This study presents a new perspective for autonomous mobile robots path searching by proposing a biasing direction towards causal entropy maximisation during random tree generation.
Rui Jiang, Hui Zhou, Hui Zhou, Han Wang, Shuzhi Sam Ge   +4 more
doaj   +1 more source

Hypergraphs in m-Polar Fuzzy Environment

Mathematics, 2018
Fuzzy graph theory is a conceptual framework to study and analyze the units that are intensely or frequently connected in a network. It is used to study the mathematical structures of pairwise relations among objects. An m-polar fuzzy (mF, for short) set
Muhammad Akram, Gulfam Shahzadi
doaj   +1 more source

Center of Trapezoid Graph: Application in Selecting Center Location to Set up a Private Hospital

Mathematics
The central location problem is a key aspect of graph theory, with a significant importance in various applications and studies within the field. The center of a graph is made up of nodes that have the smallest eccentricity, where eccentricity is defined
Shaoli Nandi, Sukumar Mondal, Sovan Samanta, Sambhu Charan Barman, Leo Mrsic, Antonios Kalampakas   +5 more
doaj   +1 more source

Efficient and Accurate Hausdorff Distance Computation Based on Diffusion Search

IEEE Access, 2018
The Hausdorff distance (HD) between two point sets is widely used in similarity measures, but the high computational cost of HD algorithms restrict their practical use.
Dejun Zhang, Lu Zou, Yilin Chen, Fazhi He   +3 more
doaj   +1 more source

A quantum partial adiabatic evolution and its application to quantum search problem

Frontiers in Physics
This paper presents a framework for quantum partial adiabatic evolution and applies it to re-examine the well-known quantum search problem. We particularly focus on a detailed analysis of the algorithm’s success probability, which serves as a clear ...
Jie Sun, Jie Sun, Hui Zheng, Hui Zheng, Songfeng Lu   +4 more
doaj   +1 more source

Optimisation of mobile intelligent terminal data pre-processing methods for crowd sensing

CAAI Transactions on Intelligence Technology, 2018
Sensor data pre-processing is an essential phase of crowd sensing application. Existing studies do not effectively solve the problem, and there still exist various sensor data pre-processing optimisation problems at the acquisition end in crowd-sensing ...
Min Huang, Yuefan Zeng, Lina Chen, Bo Sun   +3 more
doaj   +1 more source

Linear time complexity de novo long read genome assembly with GoldRush. [PDF]

Nat Commun, 2023
Wong J, Coombe L, Nikolić V, Zhang E, Nip KM, Sidhu P, Warren RL, Birol I.   +7 more
europepmc   +1 more source

Improving the smoothed complexity of FLIP for max cut problems

, 2018
Finding locally optimal solutions for max-cut and max-$k$-cut are well-known PLS-complete problems. An instinctive approach to finding such a locally optimum solution is the FLIP method. Even though FLIP requires exponential time in worst-case instances,
Bibak, Ali, Carlson, Charles, Chandrasekaran, Karthekeyan   +2 more
core   +1 more source