Search alternatives:
processing algorithm » processing algorithms (Expand Search)
research algorithm » search algorithm (Expand Search)
query processing » text processing (Expand Search)
processing algorithm » processing algorithms (Expand Search)
research algorithm » search algorithm (Expand Search)
query processing » text processing (Expand Search)
-
1
-
2
An exact and general model order reduction technique for the finite element solution of elastohydrodynamic lubrication problems
Published 2017“…This work presents an exact and general model order reduction (MOR) technique for a fast finite element resolution of elastohydrodynamic lubrication (EHL) problems. …”
Get full text
Get full text
Get full text
Get full text
article -
3
Block constrained pressure residual preconditioning for two-phase flow in porous media by mixed hybrid finite elements
Published 2023“…This preconditioner, denoted as Block CPR (BCPR), is specifically designed for Lagrange multipliers-based flow models, such as those generated by Mixed Hybrid Finite Element (MHFE) approximations. An original MHFE-based formulation of the two-phase flow model is taken as a reference for the development of the BCPR preconditioner, in which the set of system unknowns comprises both element and face pressures, in addition to the cell saturations, resulting in a $$3\times 3$$ 3 × 3 block-structured Jacobian matrix with a $$2\times 2$$ 2 × 2 inner pressure problem. …”
-
4
-
5
PERF solutions for distributed query optimization. (c1999)
Published 1999Get full text
Get full text
masterThesis -
6
Random Forest Bagging and X‐Means Clustered Antipattern Detection from SQL Query Log for Accessing Secure Mobile Data
Published 2021“…Experiments are conducted to evaluate the performance of the RFBXSQLQC technique using the IIT Bombay dataset using the metrics like antipattern detection accuracy, time complexity, false-positive rate, and computational overhead with respect to the differing number of queries. The results revealed that the RFBXSQLQC technique outperforms the existing algorithms by 19% with pattern detection accuracy, 34% minimized time complexity, 64% false-positive rate, and 31% in terms of computational overhead.…”
-
7
-
8
Combining offline and on-the-fly disambiguation to perform semantic-aware XML querying
Published 2023“…Many efforts have been deployed by the IR community to extend freetext query processing toward semi-structured XML search. …”
Get full text
Get full text
Get full text
Get full text
article -
9
Full-fledged semantic indexing and querying model designed for seamless integration in legacy RDBMS
Published 2018“…We then provide a general keyword query model with specially tailored query processing algorithms built on top of SemIndex, in order to produce semantic-aware results, allowing the user to choose the results' semantic coverage and expressiveness based on her needs. …”
Get full text
Get full text
Get full text
Get full text
article -
10
Socially Motivated Approach to Simulate Negotiation Process
Published 2014Get full text
doctoralThesis -
11
On the Optimization of Band Gaps in Periodic Waveguides
Published 2025Subjects: “…Nature-inspired optimization algorithms…”
-
12
Extended Behavioral Modeling of FET and Lattice-Mismatched HEMT Devices
Published 2016Subjects: Get full text
doctoralThesis -
13
-
14
Design of adaptive arrays based on element position perturbations
Published 1993“…The authors report on the design of a digital feedback control system to provide null steering by controlling the array element positions automatically. The array comprises a signal processor, digital control algorithm (PID), stepper motors, shaft encoders, actuators and multiplexers. …”
Get full text
Get full text
article -
15
Correlation Clustering with Overlaps
Published 2020“…We present a heuristic algorithm and a semi-exact algorithm for the Multi-Parameterized Cluster Editing with Vertex Splitting problem. …”
Get full text
Get full text
Get full text
masterThesis -
16
Adaptive bias simulated evolution algorithm for placement
Published 2001“…A new solution is evolved from current solution by relocating some of the solution elements. Elements with lower goodnesses have higher probabilities of getting selected for perturbation. …”
Get full text
Get full text
article -
17
An improved kernelization algorithm for r-Set Packing
Published 2010“…Such parameterized reductions are known as kernelization algorithms, and a reduced instance is called a problem kernel. …”
Get full text
Get full text
Get full text
article -
18
A kernelization algorithm for d-Hitting Set
Published 2010“…For a given parameterized problem, π, a kernelization algorithm is a polynomial-time pre-processing procedure that transforms an arbitrary instance of π into an equivalent one whose size depends only on the input parameter(s). …”
Get full text
Get full text
Get full text
article -
19
Fuzzy simulated evolution algorithm for topology design of campusnetworks
Published 2000“…The two main phases of the algorithm, namely, evaluation and allocation, have been fuzzified. …”
Get full text
Get full text
article -
20
A hybrid graph representation for recursive backtracking algorithms
Published 2017“…The performance of these algorithms often suffers from the increasing number of graph modifications, such as deletions, that reduce the problem instance and have to be “taken back” frequently during the search process. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject