Search alternatives:
level scheduling » self scheduling (Expand Search)
model algorithm » mould algorithm (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
level scheduling » self scheduling (Expand Search)
model algorithm » mould algorithm (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
-
61
Recursive Parameter Identification Of A Class Of Nonlinear Systems From Noisy Measurements
Published 2020“…The model structure is made up of two linear dynamic elements separated by a nonlinear static one. …”
Get full text
article -
62
-
63
Structural similarity evaluation between XML documents and DTDs
Published 2007“…We consider the various DTD operators that designate constraints on the existence, repeatability and alternativeness of XML elements/attributes. Our approach is based on the concept of tree edit distance, as an effective and efficient means for comparing tree structures, XML documents and DTDs being modeled as ordered labeled trees. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
64
A hybrid approach for XML similarity
Published 2007“…Various algorithms for comparing hierarchically structured data, e.g. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
65
Combining offline and on-the-fly disambiguation to perform semantic-aware XML querying
Published 2023“…Most methods rely on the concept of Lowest Comment Ancestor (LCA) between two or multiple structural nodes to identify the most specific XML elements containing query keywords posted by the user. …”
Get full text
Get full text
Get full text
Get full text
article -
66
Peak Loads Shaving in a Team of Cooperating Smart Buildings Powered Solar PV-Based Microgrids
Published 2021“…<p>This paper presents a scheduling framework based algorithm for reducing/shaving the peak loads in a team of cooperating microgrids (TCM) powered smart buildings taking advantages of vehicle-to-building (V2B) concept and operational flexibilities of electric vehicles (EVs). …”
-
67
-
68
A survey and comparison of wormhole routing techniques in a meshnetworks
Published 1997“…Although an extremely wide number of routing algorithms have been proposed and implemented in hardware and software, it is difficult for the designer of a multicomputer to choose the best routing algorithm given a particular architectural configuration. …”
Get full text
Get full text
article -
69
Communications in electronic textile systems
Published 2017“…This paper studies the communication requirements between the computing and sensing elements of an e-textile. This communication is studied through the construction of a prototype as well as through modeling and simulation. …”
Get full text
Get full text
Get full text
conferenceObject -
70
Analysis of Multi-User-Based UAV System With Outdated CSI
Published 2024“…Optimization of UAV location and altitude is performed through a limited-memory Broyden-Fletcher-Goldfarb-Shanno (LBFGS) algorithm to attain minimum OP (MOP). Results illustrate optimal performance dependent on the channel correlation parameters, antenna elements, and fading conditions. …”
-
71
Connectionist technique estimates of hydrogen storage capacity on metal hydrides using hybrid GAPSO-LSSVM approach
Published 2024“…So the HGAPSO-LSSVM model had the highest accuracy. In this model, the statistical factors of R<sup>2</sup>, STD, MSE, RMSE, and MRE were 0.980, 0.043, 0.0020, 0.045, and 0.972%, respectively. …”
-
72
Mobile Energy Storage Systems for Benefit Maximization in Resilient Smart Grids
Published 2025Get full text
doctoralThesis -
73
An integrated partitioning and synthesis system for dynamically reconfigurable Multi-FPGA architectures
Published 2017“…The SPARCS system accepts design specifications at the behavior level, in the form of task graphs. The system contains a temporal partitioning tool to temporally divide and schedule the tasks on the reconfigurable architecture, a spatial partitioning tool to map the tasks to individual FPGAs, and a high-level synthesis tool to synthesize efficient register-transfer level designs for each set of tasks destined to be downloaded on each FPGA. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
74
Newton-Raphson based adaptive inverse control scheme for tracking of nonlinear dynamic plants
Published 2006“…The U-model is utilized to design an adaptive inverse controller by using a simple root-solving algorithm of Newton-Raphson. …”
Get full text
Get full text
article -
75
Corona power loss computation in bundled bipolar conductors
Published 2000“…In this paper, a finite element (FE) based algorithm devoted for the computation of the corona current and hence the corona power loss associated with bundled bipolar high voltage direct current (HVDC) conductors is presented. …”
Get full text
Get full text
article -
76
Enhancing Building Energy Management: Adaptive Edge Computing for Optimized Efficiency and Inhabitant Comfort
Published 2023“…However, these BEMSs often suffer from a critical limitation—they are primarily trained on building energy data alone, disregarding crucial elements such as occupant comfort and preferences. …”
-
77
Vibration suppression in a cantilever beam using a string-type vibration absorber
Published 2017“…The string is rigidly connected to the fixed end of the beam and through a spring and damper to a second point on the beam. The finite element method is used to model the system and a reduced order model is obtained through modal reduction performed on both the string and the beam. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
78
A Full-System Approach of the Elastohydrodynamic Line/Point Contact Problem
Published 2008“…The use of the finite element method allows the use of variable unstructured meshing and different types of elements within the same model which leads to a reduced size of the problem. …”
Get full text
Get full text
Get full text
article -
79
On the complexity of multi-parameterized cluster editing
Published 2017“…In other words, Cluster Editing can be solved efficiently when the number of false positives/negatives per single data element is expected to be small compared to the minimum cluster size. …”
Get full text
Get full text
Get full text
Get full text
article -
80
A quadratic kernel for 3-set packing
Published 2017Get full text
Get full text
Get full text
Get full text
conferenceObject