بدائل البحث:
method algorithm » mould algorithm (توسيع البحث)
case scheduling » task scheduling (توسيع البحث), ahead scheduling (توسيع البحث)
element » elements (توسيع البحث)
subgroups » subgroup (توسيع البحث)
method algorithm » mould algorithm (توسيع البحث)
case scheduling » task scheduling (توسيع البحث), ahead scheduling (توسيع البحث)
element » elements (توسيع البحث)
subgroups » subgroup (توسيع البحث)
-
1
Efficient Dynamic Cost Scheduling Algorithm for Data Batch Processing
منشور في 2016احصل على النص الكامل
doctoralThesis -
2
-
3
Power-constrained system-on-a-chip test scheduling using a genetic algorithm
منشور في 2006"…This paper presents an efficient approach for the test scheduling problem of core-based systems based on a genetic algorithm. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
4
-
5
Optimized Load-Scheduling Algorithm for CubeSat's Electric Power System Management Considering Communication Link
منشور في 2023"…The solution obtained shows that the proposed scheduling algorithm meets the communication system's requirements while conserving power and energy resources.…"
-
6
Efficient Prioritization and Processor Selection Schemes for HEFT Algorithm: A Makespan Optimizer for Task Scheduling in Cloud Environment
منشور في 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. …"
-
7
-
8
A reduced model for phase-change problems with radiation using simplified PN approximations
منشور في 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. …"
احصل على النص الكامل
article -
9
Extended Behavioral Modeling of FET and Lattice-Mismatched HEMT Devices
منشور في 2016الموضوعات: احصل على النص الكامل
doctoralThesis -
10
Brain Source Localization in the Presence of Leadfield Perturbations
منشور في 2015احصل على النص الكامل
doctoralThesis -
11
Monitoring Bone Density Using Microwave Tomography of Human Legs: A Numerical Feasibility Study
منشور في 2021"…This study was performed using an in-house finite-element method contrast source inversion algorithm (FEM-CSI). …"
احصل على النص الكامل
article -
12
Optimal Management of Mobile Energy Generation and Storage Systems
منشور في 2018احصل على النص الكامل
doctoralThesis -
13
The Use of Microwave Tomography in Bone Healing Monitoring
منشور في 2019احصل على النص الكامل
doctoralThesis -
14
-
15
Design of adaptive arrays based on element position perturbations
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
article -
16
Incremental Genetic Algorithm
منشور في 2006"…Classical Genetic Algorithms (CGA) are known to find good sub-optimal solutions for complex and intractable optimization problems. …"
احصل على النص الكامل
احصل على النص الكامل
article -
17
An efficient method for the open-shop scheduling problem using simulated annealing
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
18
A GRASP Approach for Solving Large-Scale Electric Bus Scheduling Problems
منشور في 2021"…The GRASP algorithm is used for case studies on several public transport systems having various properties and sizes. …"
-
19
Incremental & classical genetic algorithm. (c2001)
منشور في 2001احصل على النص الكامل
احصل على النص الكامل
masterThesis -
20
A kernelization algorithm for d-Hitting Set
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article