Results 21 to 30 of about 149,618 (314)
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
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
On Evaluating Human Problem Solving of Computationally Hard Problems [PDF]
, 2013 This article is concerned with how computer science, and more exactly computational complexity theory, can inform cognitive science. In particular, we suggest factors to be taken into account when investigating how people deal with computational hardness.
Stege, Ulrike, Carruthers, Sarah
core +2 more sources
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
An Effective Decomposition-Based Stochastic Algorithm for Solving the Permutation Flow-Shop Scheduling Problem [PDF]
, 2021 This paper presents an effective stochastic algorithm that embeds a large neighborhood decomposition technique into a variable neighborhood search for solving the permutation flow-shop scheduling problem. The algorithm first constructs a permutation as a
Mehrdad Amirghasemi
core +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