-
1
On the steiner walk problem. (c2009)
Published 2009Subjects: “…Euclidean algorithm -- Data processing…”
Get full text
Get full text
masterThesis -
2
Application of Red Deer Algorithm in Optimizing Complex functions
Published 2021Subjects: “…RD algorithm…”
Get full text
Get full text
-
3
On the complexity of bilinear computations
Published 1984“…Arithmetic complexity theory is the study of the minimum number of non-scalar multiplications required to compute a set of bilinear forms. …”
Get full text
Get full text
Get full text
masterThesis -
4
-
5
A Novel BIPV Reconfiguration Algorithm for Maximum Power Generation under Partial Shading
Published 2020Subjects: -
6
On the complexity of multi-parameterized cluster editing
Published 2017Get full text
Get full text
Get full text
Get full text
article -
7
Correlation Clustering via s-Club Cluster Edge Deletion
Published 2023Subjects: Get full text
Get full text
Get full text
masterThesis -
8
Optimum Partition of Power Networks Using Singular Value Decomposition and Affinity Propagation
Published 2024Subjects: -
9
Exploiting Sparsity in Amplify-and-Forward Broadband Multiple Relay Selection
Published 2019Subjects: -
10
On the parameterized parallel complexity and the vertex cover problem
Published 2016Get full text
Get full text
Get full text
Get full text
conferenceObject -
11
-
12
Complexities of special matrix multiplication problems
Published 1988Get full text
Get full text
Get full text
Get full text
article -
13
On the complexity of various parameterizations of common induced subgraph isomorphism
Published 2017Get full text
Get full text
Get full text
Get full text
conferenceObject -
14
Complexity Avoidance using Biological Resemblance of Modular Multivariable Structure
Published 2014“…Combination of Fuzzy logic and Genetic Algorithm is becoming popular among researchers in the field. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
15
Assessment of network module identification across complex diseases
Published 2019“…<p dir="ltr">Many bioinformatics methods have been proposed for reducing the complexity of large gene or protein networks into relevant subnetworks or modules. …”
-
16
Detection of statistically significant network changes in complex biological networks
Published 2017“…Moreover, the structure of the proposed algorithm allows for a faster parallelized implementation.…”
-
17
Incremental Genetic Algorithm
Published 2006“…Classical Genetic Algorithms (CGA) are known to find good sub-optimal solutions for complex and intractable optimization problems. …”
Get full text
Get full text
article -
18
EFFICIENT ALGORITHM FOR WEINBERGER ARRAY FOLDING
Published 2020“…The complexity of the algorithm is 0(n-squared). The algorithm has been tested extensively on WAs that were generated circuits. …”
Get full text
article -
19
Application of Heuristic Algorithms for Multiuser Detection
Published 0000“…The new proposed structure brings several improvements when compared to both the conventional (matched filter) detector and the decorrelating detector. Additionally, the algorithm proposed here fairly approximates the performance of the optimal MUD detector with much reduced computational complexity.…”
Get full text
Get full text
article -
20
Approximation algorithms inspired by kernelization nethods
Published 2017“…Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of reduction rules and combinatorial insights. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject