Results 21 to 30 of about 133,596 (138)
Generalized Queue-Aware Resource Management and Scheduling for Wireless Communications
IEEE Access, 2015 The general problem of a queue-aware radio resource management and scheduling design is investigated for wireless communications under quasi-static fading channel conditions.
Ning Wang +3 more
doaj +1 more source
Joint likelihood estimation and model order selection for outlier censoring
IET Radar, Sonar & Navigation, 2021 This study deals with the problem of outlier censoring from the secondary data in a radar scenario, where the number of outliers is unknown. To this end, a procedure consisting of joint likelihood estimation and statistical model order selection (MOS) is
Seyed Mohammad Karbasi
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
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
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
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
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