Search Results - (( java application optimization algorithm ) OR ( _ solving search algorithm ))
Search alternatives:
- application optimization »
- java application »
- search »
-
1
Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions
Published 2018“…The second technique is to solve bi-objective functions by using the BOBAT algorithm. …”
Get full text
Get full text
Thesis -
2
Optimization of blood vessel detection in retina images using multithreading and native code for portable devices
Published 2013Get full text
Get full text
Conference or Workshop Item -
3
Performance evaluation of real-time multiprocessor scheduling algorithms
Published 2016“…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
Get full text
Get full text
Conference or Workshop Item -
4
Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem
Published 2015“…Later, binary gravitational search algorithm (BGSA) is designed to solve discrete optimization problems. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
5
Route Optimization System
Published 2005“…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
Get full text
Get full text
Final Year Project -
6
Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid
Published 2017“…Harmony search algorithm (HSA) is a population-based metaheuristic optimization algorithm that imitates the music improvisation process where musicians improvise their instruments’ pitch by searching for a perfect state of harmony. …”
Get full text
Get full text
Thesis -
7
Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid
Published 2017“…Harmony search algorithm (HSA) is a population-based metaheuristic optimization algorithm that imitates the music improvisation process where musicians improvise their instruments’ pitch by searching for a perfect state of harmony. …”
Get full text
Get full text
Book Section -
8
Dual level searching approach for solving multi objective optimisation problems using hybrid particle swarm optimisation and bats echolocation-inspired algorithms
Published 2019“…The proposed algorithm can thus be an effective method for solving of multi objective optimisation problems.…”
Get full text
Get full text
Get full text
Get full text
Article -
9
Using artificial intelligence search in solving the camera placement problem
Published 2022“…The chapter also carries out an analytical review of three main searching algorithms namely, generate and test, uninformed search, and hill climbing search algorithms. …”
Get full text
Get full text
Book -
10
Hybrid of firefly algorithm and pattern search for solving optimization problems
Published 2018“…Firefly algorithm (FA) is a newly introduced meta-heuristic, nature-inspired, stochastic algorithm for solving various types of optimization problems. …”
Get full text
Get full text
Article -
11
Pressure vessel design simulation using hybrid harmony search algorithm
Published 2019“…Recently the development of optimization algorithm is rapidly increased. Among several optimization algorithms, Harmony Search (HS) has been recently proposed for solving engineering optimization problems. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
12
Solving Economic Dispatch Problems Utilizing Cuckoo Search Algorithm
Published 2014“…This paper presents one of the latest nature-inspired meta-heuristics algorithms, namely Cuckoo Search (CS) algorithm to solve economic dispatch (ED) problems in power system. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
13
-
14
Multi-state PSO GSA for solving discrete combinatorial optimization problems
Published 2016“…These four algorithms can be used to solve discrete combinatorial optimization problems (COPs). …”
Get full text
Get full text
Thesis -
15
Performance evaluation of heuristic methods in solving symmetric travelling salesman problems
Published 2016“…The purpose of this study is to carry out a comparative evaluation study on Simulated Annealing (SA) and several variation of Tabu Search (TS).Materials and Method: This study considers four heuristic methods, i.e., Simulated Annealing (SA), conventional Tabu Search (TS), Improved Tabu Search (ITS) and modified Reactive Tabu Search (RTS) to solve symmetric TSPs.The algorithms were tested on five chosen benchmark problems. …”
Get full text
Get full text
Get full text
Article -
16
Multiple Objective Optimization of Green Logistics Using Cuckoo Searching Algorithm
Published 2016“…In this paper, a modified Cuckoo searching algorithm is proposed to solve the multiple objective Green Logistics optimization problem. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
17
Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems
Published 2020“…This indicates the capability of the algorithm in exploring the search space. The 2S-ENDSHHMO algorithm can be used to improve the search process of other MOSI-based algorithms and can be applied to solve MOPs in applications such as structural design and signal processing.…”
Get full text
Get full text
Get full text
Get full text
Thesis -
18
Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms
Published 2018“…In this research, a new hybrid algorithm of Harmony search and Jaya search algorithms applied on 0/1 Knapsack problem to find a near optimal results. …”
Get full text
Get full text
Get full text
Get full text
Article -
19
Neutralisation state driven single-agent search strategy for solving constraint satisfaction problem / Saajid Akram Ahmed Abuluaih
Published 2019“…Therefore, most of the recent research in the field is devoted to improving the problem solvers that utilize search strategies and techniques. Since Constraint Satisfaction Problem (CSP) is an NP-complete problem, brute-force search algorithms such as Backtracking algorithm (BT) are required as the guarantee to find a solution, when there is one. …”
Get full text
Get full text
Thesis -
20
Pendulum-like algorithm as a local search technique
Published 2023“…Aluminum; Approximation algorithms; Local search (optimization); Optimization; Pendulums; Problem solving; attraction; Global solutions; Local search; Local search techniques; Optimization problems; repulsion; Repulsion mechanisms; simple harmonic; Parameter estimation…”
Conference Paper
