Results 31 to 40 of about 151,418 (244)
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
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
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
Asilomar Conference on Signals, Systems and Computers, 2018 Consider a distributed non-convex optimization problem, in which a number of agents connected by a network $\mathcal{G}$ collectively optimize a sum of smooth and non-convex local objective functions.
Haoran Sun, Mingyi Hong
semanticscholar +1 more source
Comparative Analysis between Dijkstra and Bellman-Ford Algorithms in Shortest Path Optimization
IOP Conference Series: Materials Science and Engineering, 2020 Due to the tremendous development in the field of computer and software sciences, the theory of graphics has spread widely and quickly, even becoming one of the most important sciences that played a large role in solving many problems of many diverse ...
Samah W. G. AbuSalim +4 more
semanticscholar +1 more source
The fine-grained and parallel complexity of andersen’s pointer analysis
Proc. ACM Program. Lang., 2020 Pointer analysis is one of the fundamental problems in static program analysis. Given a set of pointers, the task is to produce a useful over-approximation of the memory locations that each pointer may point-to at runtime.
Anders Alnor Mathiasen +1 more
semanticscholar +1 more source
Iteration complexity analysis of dual first-order methods for conic convex programming [PDF]
Optim. Methods Softw., 2014 In this paper we provide a detailed analysis of the iteration complexity of dual first-order methods for solving conic convex problems. When it is difficult to project on the primal feasible set described by conic and convex constraints, we use the ...
I. Necoara, A. Pătraşcu
semanticscholar +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
Timing of Autonomous Driving Software: Problem Analysis and Prospects for Future Solutions
IEEE Real Time Technology and Applications Symposium, 2020 The software used to implement advanced functionalities in critical domains (e.g. autonomous operation) impairs software timing. This is not only due to the complexity of the underlying high-performance hardware deployed to provide the required levels of
Miguel Alcon +5 more
semanticscholar +1 more source