Results 11 to 20 of about 7,149,925 (323)

Minimum Distance and Minimum Time Optimal Path Planning With Bioinspired Machine Learning Algorithms for Faulty Unmanned Air Vehicles

IEEE Transactions on Intelligent Transportation Systems
Unmanned air vehicles operate in highly dynamic and unknown environments where they can encounter unexpected and unseen failures. In the presence of emergencies, autonomous unmanned air vehicles should be able to land at a minimum distance or minimum ...
Onder Tutsoy, D. Asadi, Karim Ahmadi, S. Nabavi-Chashmi, Jamshed Iqbal   +4 more
semanticscholar   +3 more sources

Minimum Manhattan Distance Approach to Multiple Criteria Decision Making in Multiobjective Optimization Problems [PDF]

IEEE Transactions on Evolutionary Computation, 2016
A minimum Manhattan distance (MMD) approach to multiple criteria decision making in multiobjective optimization problems (MOPs) is proposed. The approach selects the final solution corresponding with a vector that has the MMD from a normalized ideal ...
Wei-Yu Chiu, G. Yen, Teng-Kuei Juan
semanticscholar   +3 more sources

Quantum LDPC Codes With Almost Linear Minimum Distance [PDF]

IEEE Transactions on Information Theory, 2020
We give a construction of quantum LDPC codes of dimension $\Theta (\log N)$ and distance $\Theta (N/\log N)$ as the code length $N\to \infty $ . Using a product of chain complexes this construction also provides a family of quantum LDPC codes of ...
Pavel Panteleev, G. Kalachev
semanticscholar   +1 more source

Speeding Up Minimum Distance Randomness Tests

Journal of Telecommunications and Information Technology, 2022
Randomness testing is one of the essential and easiest tools for the evaluation of the features and quality of cryptographic primitives. The faster we can test, the greater volumes of data can be checked and evaluated and, hence, more detailed analyses ...
Krzysztof Mańk
doaj   +1 more source

Minimum entropy production, detailed balance and Wasserstein distance for continuous-time Markov processes [PDF]

Journal of Physics A: Mathematical and Theoretical, 2021
We investigate the problem of minimizing the entropy production for a physical process that can be described in terms of a Markov jump dynamics. We show that, without any further constraints, a given time-evolution may be realized at arbitrarily small ...
A. Dechant
semanticscholar   +1 more source

New Construction of Low-Density Parity-Check Codes Based on Vector Space Over Finite Fields

IEEE Access, 2020
Low-Density Parity-Check (LDPC) codes have low linear decoding complexity, which is a kind of good codes with excellent performance. Therefore, LDPC codes have great research value.
Xuemei Liu, Lihua Jia
doaj   +1 more source

Combining distance and anatomical information for deep-learning based dose distribution predictions for nasopharyngeal cancer radiotherapy planning

Frontiers in Oncology, 2023
PurposeDeep-learning effectively predicts dose distributions in knowledge-based radiotherapy planning. Using anatomical information that includes a structure map and computed tomography (CT) data as input has been proven to work well.
Xinyuan Chen, Xinyuan Chen, Ji Zhu, Bining Yang, Deqi Chen, Kuo Men, Jianrong Dai   +6 more
doaj   +1 more source

DEGREE DISTANCE AND MINIMUM DEGREE [PDF]

Bulletin of the Australian Mathematical Society, 2012
AbstractLet G be a finite connected graph of order n, minimum degree δ and diameter d. The degree distance D′(G) of G is defined as ∑ {u,v}⊆V (G)(deg u+deg v) d(u,v), where deg w is the degree of vertex w and d(u,v) denotes the distance between u and v. In this paper, we find an asymptotically sharp upper bound on the degree distance in terms of order,
Mukwembi, S., Munyira, S.
openaire   +2 more sources

Entanglement-assisted quantum MDS codes from constacyclic codes with large minimum distance [PDF]

Finite Fields Their Appl., 2018
The entanglement-assisted (EA) formalism allows arbitrary classical linear codes to transform into entanglement-assisted quantum error correcting codes (EAQECCs) by using pre-shared entanglement between the sender and the receiver.
Liangdong Lu, Wenping Ma, Ruihu Li, Yuena Ma, Yang Liu, Hao Cao   +5 more
semanticscholar   +1 more source

Sparse Blossom: correcting a million errors per core second with minimum-weight matching [PDF]

Quantum, 2023
In this work, we introduce a fast implementation of the minimum-weight perfect matching (MWPM) decoder, the most widely used decoder for several important families of quantum error correcting codes, including surface codes.
O. Higgott, C. Gidney
semanticscholar   +1 more source