Search Results - (( integer implementation case algorithm ) OR ( java demand optimization algorithm ))
Search alternatives:
- integer implementation »
- implementation case »
- demand optimization »
- case algorithm »
- java »
-
1
Optimization of blood vessel detection in retina images using multithreading and native code for portable devices
Published 2013“…The optimization of a computationally intensive algorithm such as this on a mobile platform is challenging due to the limited resources available. …”
Get full text
Get full text
Conference or Workshop Item -
2
Case Slicing Technique for Feature Selection
Published 2004“…Case Slicing Technique (CST) helps in identifying the subset of features used in computing the similarity measures needed by classification algorithms. …”
Get full text
Get full text
Thesis -
3
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…Enhance hybrid genetic algorithm and particle Swarm optimization are developed to select the optimal device in either fog or cloud. …”
Get full text
Get full text
Article -
4
Development of symbolic algorithms for certain algebraic processes
Published 2007“…In the case of dense Legendre basis polynomials with a big GCD solution, the modular algorithm is significantly superior to the nonmodular algorithms in higher degree polynomials. …”
Get full text
Get full text
Get full text
Monograph -
5
Development of symbolic algorithms for certain algebraic processes
Published 2007“…In the case of dense Legendre basis polynomials with a big GCD solution, the modular algorithm is significantly superior to the nonmodular algorithms in higher degree polynomials. …”
Get full text
Get full text
Get full text
Monograph -
6
Input-output based relation combinatorial testing using whale optimization algorithm for generating near optimum number of test suite
Published 2025“…This study proposes a combinatorial testing method utilizing the Whale Optimization Algorithm (WOA). The study compares the performance of WOA with various existing strategies, such as Greedy, Density, TVG, Union, ParaOrder, ReqOrder, ITTDG, AURA, Java Algorithm (CTJ), TTSGA, and AFA. …”
Get full text
Get full text
Get full text
Article -
7
Reverse logistics network optimizing by genetic algorithm: a case study of automotive wiring harnesses
Published 2014“…With regards to the complexity of the reverse logistics network, traditional method cannot be implemented for solving them. Thus, an evolutionary algorithm based genetic algorithm (GA) is applied as a solution methodology to solve mixed integer linear programming model and find the optimum solution. …”
Get full text
Get full text
Get full text
Article -
8
-
9
Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems
Published 2018“…Additionally, the MTS algorithm is also implemented in parallel computing to produce parallel MTS for generating comparable solutions in shorter computational times. …”
Get full text
Get full text
Thesis -
10
-
11
-
12
-
13
A study on the significance of backlash width values to the performance of the MIQP-based design of MPC
Published 2005“…Simulation results via an industrial Fluidized Catalytic Cracking Unit (FCCU) case study are presented to show the significance of precise estimation of the backlash width in ensuring successful implementation of the MIQP-based design of MPC.…”
Get full text
Get full text
Conference or Workshop Item -
14
-
15
Propositional satisfiability method in rough classification modeling for data mining
Published 2002“…Two models, Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) to represent the minimal reduct computation problem were proposed. …”
Get full text
Get full text
Thesis -
16
Energy-aware task scheduling for streaming applications on NoC-based MPSoCs
Published 2024“…Our approach is supported by a set of novel techniques, which include constructing an initial schedule based on a list scheduling where the priority of each task is its approximate successor-tree-consistent deadline such that the workload across all the processors is balanced, a retiming heuristic to transform intraperiod dependencies into inter-period dependencies for enhancing parallelism, assigning an optimal discrete frequency for each task and each message using a Non-Linear Programming (NLP)-based algorithm and an Integer-Linear Programming (ILP)-based algorithm, and an incremental approach to reduce the memory usage of the retimed schedule in case of memory size violations. …”
Get full text
Get full text
Get full text
Article -
17