Results 31 to 40 of about 148,724 (314)
OVERVIEW OF METHODS AND ALGORITHMS OF CONSTRUCTING SHORTEST PATHS AND PROSPECTS OF THEIR DEVELOPMENT
Міжнародний науково-технічний журнал "Проблеми керування та інформатики", 2020 Despite the numerous works related to the problem of finding the shortest paths (SP), attention to the development of speed-efficient algorithms for constructing SP is not reduced.
О.М. Трофимчук +2 more
doaj +1 more source
Mathematics, 2022 In the supervised classification area, the algorithm selection problem (ASP) refers to determining the a priori performance of a given classifier in some specific problem, as well as the finding of which is the most suitable classifier for some tasks ...
Claudia C. Tusell-Rey +5 more
doaj +1 more source
Sieve algorithms for the shortest vector problem are practical
Journal of Mathematical Cryptology, 2008 The most famous lattice problem is the Shortest Vector Problem (SVP), which has many applications in cryptology. The best approximation algorithms known for SVP in high dimension rely on a subroutine for exact SVP in low dimension.
Nguyen Phong Q., Vidick Thomas
doaj +1 more source
Attractor detection and enumeration algorithms for Boolean networks
Computational and Structural Biotechnology Journal, 2022 The Boolean network (BN) is a mathematical model used to represent various biological processes such as gene regulatory networks. The state of a BN is determined from the previous state and eventually reaches a stable state called an attractor.
Tomoya Mori, Tatsuya Akutsu
doaj +1 more source
Mathematics, 2023 The quickest path problem in multistate flow networks, which is also known as the quickest path reliability problem (QPRP), aims at calculating the probability of successfully sending a minimum of d flow units/data/commodity from a source node to a ...
Majid Forghani-elahabad +1 more
doaj +1 more source
Advances in Computing and EngineeringThe Knapsack problem is a combinatorial optimization problem whose exact solution using exhaustive search method is impractical. Hence, the application of approximate algorithms is usually considered when encountering this optimization problem.
Bashar Bin Usman +5 more
doaj +1 more source
An Anti-Collision Algorithm for RFID Based on an Array and Encoding Scheme
Information, 2018 In order to solve the problem of tag collision in Radio Frequency Identification (RFID) system, the paper proposes a Multi-Bit Identification Collision Tree (MICT) algorithm based on a collision tree.
Baolong Liu, Xiaohao Su
doaj +1 more source
Randomized Parameterized Algorithms for the Kidney Exchange Problem
, 2019 In order to increase the potential kidney transplants between patients and their incompatible donors, kidney exchange programs have been created in many countries.
Bin Fu +7 more
core +1 more source
A Multi-Dimensional Matrix Product—A Natural Tool for Parameterized Graph Algorithms
, 2022 We introduce the concept of a k-dimensional matrix product D of k matrices A1,…,Ak of sizes n1×n,…,nk×n, respectively, where D[i1,…,ik] is equal to ∑ℓ=1nA1[i1,ℓ]×…×Ak[ik,ℓ].
Lingas, Andrzej +3 more
core +1 more source
On Coverage and Capacity for Disaster Area Wireless Networks Using Mobile Relays
EURASIP Journal on Wireless Communications and Networking, 2009 Public safety organizations increasingly rely on wireless technology to provide effective communications during emergency and disaster response operations.
Wenxuan Guo, Xinming Huang
doaj +2 more sources