Search alternatives:
processing algorithm » processing algorithms (Expand Search)
using algorithm » cosine algorithm (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
element » elements (Expand Search)
processing algorithm » processing algorithms (Expand Search)
using algorithm » cosine algorithm (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
element » elements (Expand Search)
-
181
On the parameterized parallel complexity and the vertex cover problem
Published 2016“…We initiate the study of FPPT with the well-known k-vertex cover problem. In particular, we present a parallel algorithm that outperforms the best known parallel algorithm for this problem: using O(m) instead of O(n2) parallel processors, the running time improves from 4logn+O(kk) to O(k⋅log3n) , where m is the number of edges, n is the number of vertices of the input graph, and k is an upper bound of the size of the sought vertex cover. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
182
-
183
-
184
-
185
Severity-Based Prioritized Processing of Packets with Application in VANETs
Published 2019“…Although DSRC and WAVE have been adopted as the de facto standards, they do not address all the problems and there is room for improvements. In this study, we propose a generic prioritization and resource management algorithm that can be used to prioritize processing of received packets in vehicular networks. …”
-
186
Stochastic optimal power flow framework with incorporation of wind turbines and solar PVs using improved liver cancer algorithm
Published 2024“…Moreover, ILCA is applied to resolve the stochastic renewable‐based (wind turbines + PVs) optimal power flow problem using a modified RER‐based IEEE 57‐bus. The objective of this work is to obtain the minimum predicted power losses and enhance the predicted voltage stability. …”
-
187
-
188
Fuzzy genetic algorithm for floorplanning
Published 2020“…Genetic algorithms (GAs) have been found to be very effective in solving numerous optimization problems, especially those with many (possibly) conflicting and noisy objectives. …”
Get full text
article -
189
-
190
BUC algorithm for iceberg cubes
Published 2003“…The Uniform distribution is used as a basis for comparison. Results show that when the cube is sparse there is a correlation between the data distribution and the running time of the algorithm. …”
Get full text
Get full text
Get full text
conferenceObject -
191
An enhanced quorum selection algorithm
Published 2009Get full text
Get full text
Get full text
article -
192
An Improved Quorum Selection Algorithm
Published 2008Get full text
Get full text
Get full text
Get full text
conferenceObject -
193
TIDCS: A Dynamic Intrusion Detection and Classification System Based Feature Selection
Published 2020“…TIDCS reduces the number of features in the input data based on a new algorithm for feature selection. …”
-
194
Random Forest Bagging and X‐Means Clustered Antipattern Detection from SQL Query Log for Accessing Secure Mobile Data
Published 2021“…In addition, for grouping similar antipatterns, a clustering process was performed to eradicate the design errors. …”
-
195
A multiobjective optimization method for the SOC Test Time, TAM, and power optimization using a strength pareto evolutionary algorithm
Published 2017“…This paper presents a multiobjective optimization approach for the SOC test scheduling problem. The method uses a Strength Pareto Evolutionary Algorithm that minimizes the overall test application time in addition to power, wrapper design and TAM assignment. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
196
The monotone circuit value problem with bounded genus is in NC
Published 2017“…We present an efficient parallel algorithm for the general Monotone Circuit Value Problem (MCVP) with n gates and an underlying graph of bounded genus k. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
197
Correlation Clustering with Overlaps
Published 2020“…Moreover, we allow the new vertex splitting operation, which allows the resulting clusters to overlap. In other words, data elements (or vertices) will be allowed to be members in more than one cluster instead of limiting them to only one single cluster, as in classical clustering methods. …”
Get full text
Get full text
Get full text
masterThesis -
198
-
199
Optimum sensors allocation for drones multi-target tracking under complex environment using improved prairie dog optimization
Published 2024“…The IPDOA performance was compared with the other 8 metaheuristic optimization algorithms and the testing showed its superiority over those techniques for solving this complex problem. …”
Get full text
-
200