Search alternatives:
method algorithm » mould algorithm (Expand Search)
making algorithm » cosine algorithm (Expand Search)
case scheduling » task scheduling (Expand Search), ahead scheduling (Expand Search)
solved making » mold making (Expand Search)
method algorithm » mould algorithm (Expand Search)
making algorithm » cosine algorithm (Expand Search)
case scheduling » task scheduling (Expand Search), ahead scheduling (Expand Search)
solved making » mold making (Expand Search)
-
1
Efficient Dynamic Cost Scheduling Algorithm for Data Batch Processing
Published 2016Get full text
doctoralThesis -
2
-
3
-
4
Power-constrained system-on-a-chip test scheduling using a genetic algorithm
Published 2006“…This paper presents an efficient approach for the test scheduling problem of core-based systems based on a genetic algorithm. …”
Get full text
Get full text
Get full text
article -
5
Extended Behavioral Modeling of FET and Lattice-Mismatched HEMT Devices
Published 2016Subjects: Get full text
doctoralThesis -
6
Optimized Load-Scheduling Algorithm for CubeSat's Electric Power System Management Considering Communication Link
Published 2023“…The solution obtained shows that the proposed scheduling algorithm meets the communication system's requirements while conserving power and energy resources.…”
-
7
Efficient Prioritization and Processor Selection Schemes for HEFT Algorithm: A Makespan Optimizer for Task Scheduling in Cloud Environment
Published 2022“…Among these methods, the Heterogeneous Earliest Finish Time (HEFT) algorithm is recognized to produce optimal outcomes in a shorter time period for scheduling tasks in a heterogeneous environment. …”
-
8
Stochastic management of hybrid AC/DC microgrids considering electric vehicles charging demands
Published 2020“…A novel evolving solution based on flower pollination algorithm is also proposed to solve the problem optimally. …”
Get full text
Get full text
Get full text
article -
9
-
10
A reduced model for phase-change problems with radiation using simplified PN approximations
Published 2025“…The integro-differential equation for the full radiative transfer is replaced by a set of differential equations which are independent of the angle variable and easy to solve using conventional computational methods. To solve the coupled equations, we implement a second-order implicit scheme for the time integration and a mixed finite element method for the space discretization. …”
Get full text
article -
11
Brain Source Localization in the Presence of Leadfield Perturbations
Published 2015Get full text
doctoralThesis -
12
Optimal Management of Mobile Energy Generation and Storage Systems
Published 2018Get full text
doctoralThesis -
13
Monitoring Bone Density Using Microwave Tomography of Human Legs: A Numerical Feasibility Study
Published 2021“…This study was performed using an in-house finite-element method contrast source inversion algorithm (FEM-CSI). …”
Get full text
article -
14
-
15
Design of adaptive arrays based on element position perturbations
Published 1993“…The main advantage of using this technique over the other commonly used methods is that the amplitudes and phases of the array elements can be used mainly to steer the main beam towards the desired signal. …”
Get full text
Get full text
article -
16
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 -
17
The Use of Microwave Tomography in Bone Healing Monitoring
Published 2019Get full text
doctoralThesis -
18
An efficient method for the open-shop scheduling problem using simulated annealing
Published 2016“…This paper presents a simulated annealing algorithm in order to solve the nonpreemptive open-shop scheduling problem with the objective of minimizing the makespan. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
19
A GRASP Approach for Solving Large-Scale Electric Bus Scheduling Problems
Published 2021“…The GRASP algorithm is used for case studies on several public transport systems having various properties and sizes. …”
-
20
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