Results 41 to 50 of about 4,693,176 (171)
Dynamical complexity of discrete time regulatory networks
, 2005 Genetic regulatory networks are usually modeled by systems of coupled differential equations and by finite state models, better known as logical networks, are also used.
Aguirre C Martin J Vilela Mendes R +5 more
core +1 more source
An Efficient Algorithm for Sorting and Duplicate Elimination by Using Logarithmic Prime Numbers
Big Data and Cognitive ComputingData structures such as sets, lists, and arrays are fundamental in mathematics and computer science, playing a crucial role in numerous real-life applications.
Wei-Chang Yeh, Majid Forghani-elahabad
doaj +1 more source
Prototype implementation of segment assembling software [PDF]
Serbian Journal of Electrical Engineering, 2018 IT education is very important and a lot of effort is put into the development of tools for helping students to acquire programming knowledge and for helping teachers in automating the examination process. This paper describes a prototype of the
Pešić Đorđe +3 more
doaj +1 more source
On Finding All Reducts of Consistent Decision Tables
Cybernetics and Information Technologies, 2015 The problem of finding reducts plays an important role in processing information on decision tables. The objective of the attribute reduction problem is to reject a redundant attribute in order to find a core attribute for data processing.
Janos Demetrovics +2 more
doaj +1 more source
Taming Quantum Time Complexity [PDF]
QuantumQuantum query complexity has several nice properties with respect to composition. First, bounded-error quantum query algorithms can be composed without incurring log factors through error reduction $exactness$.
Aleksandrs Belovs +2 more
doaj +1 more source
Relation is an option for processing context information
Frontiers in Artificial Intelligence, 2022 Attention mechanisms are one of the most frequently used architectures in the development of artificial intelligence because they can process contextual information efficiently.
Kazunori D Yamada +4 more
doaj +1 more source
Robust Flows over Time: Models and Complexity Results
, 2017 We study dynamic network flows with uncertain input data under a robust optimization perspective. In the dynamic maximum flow problem, the goal is to maximize the flow reaching the sink within a given time horizon $T$, while flow requires a certain ...
Gottschalk, Corinna +5 more
core +1 more source
Recognizing sparse perfect elimination bipartite graphs [PDF]
, 2010 When applying Gaussian elimination to a sparse matrix, it is desirable to avoid turning zeros into non-zeros to preserve the sparsity. The class of perfect elimination bipartite graphs is closely related to square matrices that Gaussian elimination can ...
Bomhoff, Matthijs
core +6 more sources
Quantum Linear System Algorithm for General Matrices in System Identification
Entropy, 2022 Solving linear systems of equations is one of the most common and basic problems in classical identification systems. Given a coefficient matrix A and a vector b, the ultimate task is to find the solution x such that Ax=b.
Kai Li +6 more
doaj +1 more source
Exponential Time Complexity of Weighted Counting of Independent Sets
, 2010 We consider weighted counting of independent sets using a rational weight x: Given a graph with n vertices, count its independent sets such that each set of size k contributes x^k.
A.D. Scott +21 more
core +1 more source