Results 21 to 30 of about 871,423 (283)

Spatial Cluster Analysis by the Bin-Packing Problem and DNA Computing Technique

Discrete Dynamics in Nature and Society, 2013
Spatial cluster analysis is an important data mining task. Typical techniques include CLARANS, density- and gravity-based clustering, and other algorithms based on traditional von Neumann's computing architecture.
Xiyu Liu, Jie Xue
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

Using a Node–Child Matrix to Address the Quickest Path Problem in Multistate Flow Networks under Transmission Cost Constraints

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, Omar Mutab Alsalami   +1 more
doaj   +1 more source

Enhancing computational efficiency in solving Knapsack problem: insights from algorithmic parallelization and optimization

Advances in Computing and Engineering
The 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, Okeyinka Aderemi Elisha, Ibrahim Abdullahi, Idris Rabiu, Adamu Isah, Abdulganiyyu Abdulrahman   +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

Optimal randomized multilevel algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition

, 2012
In this paper, we consider the infinite-dimensional integration problem on weighted reproducing kernel Hilbert spaces with norms induced by an underlying function space decomposition of ANOVA-type.
Baldeaux J., Caflisch R. E., Giles M. B., Gnewuch M., Jan Baldeaux, Michael Gnewuch, Niederreiter H., Owen A. B.   +7 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

Computational complexity of swarm-based algorithms: a detailed analysis

AIMS Mathematics
In recent years, swarm-based algorithms have been applied to numerous optimization problems. These algorithms use a set or population of solutions that are updated in an iterative process to obtain an approximate solution to the problem.
María-Luisa Pérez-Delgado, Jesús-Ángel Román-Gallego   +1 more
doaj   +1 more source

A Fast Neural Network Learning Algorithm with Approximate Singular Value Decomposition

International Journal of Applied Mathematics and Computer Science, 2019
The learning of neural networks is becoming more and more important. Researchers have constructed dozens of learning algorithms, but it is still necessary to develop faster, more flexible, or more accurate learning algorithms.
Jankowski Norbert, Linowiecki Rafał
doaj   +1 more source