Search alternatives:
modeling algorithm » scheduling algorithm (Expand Search)
method algorithm » mould algorithm (Expand Search)
level modeling » event modeling (Expand Search)
rl algorithm » rd algorithm (Expand Search), carlo algorithm (Expand Search), _ algorithms (Expand Search)
complement » implement (Expand Search), complementary (Expand Search)
element » elements (Expand Search)
modeling algorithm » scheduling algorithm (Expand Search)
method algorithm » mould algorithm (Expand Search)
level modeling » event modeling (Expand Search)
rl algorithm » rd algorithm (Expand Search), carlo algorithm (Expand Search), _ algorithms (Expand Search)
complement » implement (Expand Search), complementary (Expand Search)
element » elements (Expand Search)
-
21
-
22
Sensitivity analysis and genetic algorithm-based shear capacity model for basalt FRC one-way slabs reinforced with BFRP bars
Published 2023“…Finally, a design equation that can predict the shear capacity of one-way BFRC-BFRP slabs was proposed based on genetic algorithm. The proposed model showed the best prediction accuracy compared to the available design codes and guidelines with a mean of predicted to experimental shear capacities (V<sub>pred</sub>/V<sub>exp</sub>) ratio of 0.97 and a coefficient of variation of 17.91%.…”
-
23
-
24
Improvement Algorithm for Limited Space Scheduling
Published 2001“…The model characterizes resource space requirements over time and establishes a time-space relationship for each activity in the schedule, based on alternative resource levels. …”
Get full text
Get full text
article -
25
Scheduling and allocation in high-level synthesis using stochastic techniques
Published 2020“…High-level synthesis is the process of automatically translating abstract behavioral models of digital systems to implementable hardware. …”
Get full text
article -
26
Decision-level Gait Fusion for Human Identification at a Distance
Published 2014Get full text
doctoralThesis -
27
A kernelization algorithm for d-Hitting Set
Published 2010“…For 3-Hitting Set, an arbitrary instance is reduced into an equivalent one that contains at most 5k2+k elements. This kernelization is an improvement over previously known methods that guarantee cubic-order kernels. …”
Get full text
Get full text
Get full text
article -
28
A New Hamiltonian Semi-Analytical Approach to Vibration Analysis of Piezoelectric Multi-Layered Plates
Published 2024“…The whole piezoelectric multilayered plate’s dynamic stiffness is then built, from which its circular frequencies are computed with the help of the Wittrick-Williams algorithm. A detailed discussion is provided on the implementation aspects, followed by some numerical examples to assess the robustness, accuracy and effectiveness of the proposed method. …”
Get full text
article -
29
Formal synthesis of VLSI layouts from algorithmic specifications
Published 2020“…In this paper we present a formal approach for high level synthesis. This formal high level syntesis system uses recursive algorithms to model the behaviour to be synthesized. …”
Get full text
article -
30
Intelligent Rapidly-Exploring Random Tree Star Algorithm
Published 2024Get full text
doctoralThesis -
31
A neural networks algorithm for data path synthesis
Published 2003“…This paper presents a deterministic parallel algorithm to solve the data path allocation problem in high-level synthesis. …”
Get full text
Get full text
Get full text
article -
32
Spectrum Sensing Algorithms for Cooperative Cognitive Radio Networks
Published 2010Get full text
doctoralThesis -
33
-
34
Block constrained pressure residual preconditioning for two-phase flow in porous media by mixed hybrid finite elements
Published 2023“…<p dir="ltr">This work proposes an original preconditioner that couples the Constrained Pressure Residual (CPR) method with block preconditioning for the efficient solution of the linearized systems of equations arising from fully implicit multiphase flow models. …”
-
35
Efficient Dynamic Cost Scheduling Algorithm for Data Batch Processing
Published 2016Get full text
doctoralThesis -
36
Impact of Charging Electric Vehicles under Different State of Charge Levels and Extreme Conditions
Published 2021“…This paper defines extreme conditions as the state of a load or network that breaks the limits of the constraints in an optimization model. Once these constraints are violated, the optimization algorithm might not work correctly and might not converge to a feasible solution, especially when the complexity of the system increases and includes nonlinearities. …”
-
37
A method for optimizing test bus assignment and sizing for system-on-a-chip
Published 2017“…Test access mechanism (TAM) is an important element of test access architectures for embedded cores and is responsible for on-chip test patterns transport from the source to the core under test to the sink. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
38
Efficient Dynamic Cost Scheduling Algorithm for Financial Data Supply Chain
Published 2021“…The objective is to minimize different cost types while satisfying constraints such as resources availability, customer service level, and tasks dependency relation. The algorithm proved its effectiveness by allocating tasks with higher priority and weight while taking into consideration customers’ Service Level Agreement, time, and different types of costs, which led to a lower total cost of the batching process. …”
Get full text
article -
39
Assessment of static pile design methods and non-linear analysis of pile driving
Published 2006“…The pile/soil interaction system is described by a mass/spring/dashpot system where the properties of each component are derived from rigorous analytical solutions or finite element analysis. The outcome of this research is an algorithm that can be used to predict pile displacement and driving stresses. …”
Get full text
Get full text
Get full text
masterThesis -
40
Evolutionary algorithms for state justification in sequential automatic test pattern generation
Published 2005“…A common search operation in sequential Automatic Test Pattern Generation is to justify a desired state assignment on the sequential elements. State justification using deterministic algorithms is a difficult problem and is prone to many backtracks, which can lead to high execution times. …”
Get full text
article