Search Results - (( wave application ((bat algorithm) OR (path algorithm)) ) OR ( some application need algorithm ))
Search alternatives:
- wave application »
- some application »
- application need »
- path algorithm »
- need algorithm »
- bat algorithm »
-
1
A generalized laser simulator algorithm for mobile robot path planning with obstacle avoidance
Published 2022“…With application of the all-direction border scan, it outperforms the A-star (A*) and PRM algorithms and provides safer and shorter paths. …”
Get full text
Get full text
Get full text
Get full text
Article -
2
-
3
-
4
Development of a State-Space Observer for Active Noise Control Systems
Published 2009Get full text
Get full text
Thesis -
5
Efficient and scalable ant colony optimization based WSN routing protocol for IoT
Published 2020“…For this reason, many intelligent systems have been utilized to design routing algorithms to handle the network's dynamic state. In this paper, an ant colony optimization (ACO) based WSN routing algorithm for IoT has been proposed and analyzed to enhance scalability, to accommodate node mobility and to minimize initialization delay for time critical applications in the context of IoT to find the optimal path of data transmission, improvising efficient IoT communications. …”
Get full text
Get full text
Get full text
Get full text
Article -
6
VITILIGO LESION ASSESSMENT TOOL ON SMARTPHONE
Published 2013“…The effectiveness of a treatment depends on the type of the skin disorder, as some disorders can be easily managed by creams and ointments and some need long-term treatments. …”
Get full text
Get full text
Final Year Project -
7
-
8
Implementation of Cognitive Mapping Algorithm for Robot Navigation System
Published 2014Get full text
Get full text
Get full text
Proceeding Paper -
9
-
10
An Efficient Computational Algorithm for Solving Arbitrary Sylvester Matrix Equations in Fuzzy Control Theory (S/O 14179)
Published 2021“…With that, the constructed algorithm is considered as a new contribution to the application of control system theory…”
Get full text
Get full text
Monograph -
11
-
12
Iterative methods for solving split common fixed point problems in Hilbert spaces
Published 2016“…Our interest here is to apply these mappings to propose some algorithms for solving split common fixed point problems and its variant forms, in the end, we prove the convergence results of these algorithms. …”
Get full text
Get full text
Get full text
Thesis -
13
Dijkstra’s algorithm in Product Searching System (ProSearch) / Nur Hasni Nasrudin ... [et al.]
Published 2015“…There are huge numbers of supermarkets these days. Some customers find it difficult for them to get the items that are needed for. …”
Get full text
Get full text
Conference or Workshop Item -
14
HISEC: a new lightweight block cipher algorithm
Published 2014“…Lightweight block cipher algorithms are vital for constrained environment. There are many applications need secured lightweight block cipher algorithm like credit card, E-passport and etc. …”
Get full text
Get full text
Get full text
Get full text
Proceeding Paper -
15
-
16
Deploying blockchains to simplify AI algorithm auditing
Published 2023“…Moreover, this review also discusses some potential challenges that need to be addressed and some future recommendations for this integration.…”
Get full text
Get full text
Get full text
Get full text
Proceeding Paper -
17
Survey on job scheduling mechanisms in grid environment
Published 2015“…Grid systems provide geographically distributed resources for both computational intensive and data-intensive applications.These applications generate large data sets.However, the high latency imposed by the underlying technologies; upon which the grid system is built (such as the Internet and WWW), induced impediment in the effective access to such huge and widely distributed data.To minimize this impediment, jobs need to be scheduled across grid environments to achieve efficient data access.Scheduling multiple data requests submitted by grid users onto the grid environment is NP-hard.Thus, there is no best scheduling algorithm that cuts across all grids computing environments.Job scheduling is one of the key research area in grid computing.In the recent past many researchers have proposed different mechanisms to help scheduling of user jobs in grid systems.Some characteristic features of the grid components; such as machines types and nature of jobs at hand means that a choice needs to be made for an appropriate scheduling algorithm to march a given grid environment.The aim of scheduling is to achieve maximum possible system throughput and to match the application needs with the available computing resources.This paper is motivated by the need to explore the various job scheduling techniques alongside their area of implementation.The paper will systematically analyze the strengths and weaknesses of some selected approaches in the area of grid jobs scheduling.This helps researchers better understand the concept of scheduling, and can contribute in developing more efficient and practical scheduling algorithms.This will also benefit interested researchers to carry out further work in this dynamic research area.…”
Get full text
Get full text
Get full text
Article -
18
Low power pipelined FFT processor architecture on FPGA
Published 2018Get full text
Get full text
Conference or Workshop Item -
19
An investigation of scheduling and packet reordering algorithms for bandwidth aggregation in heterogeneous wireless networks
Published 2013“…In this regard,some critical issues like packet loss, packet reordering and delay need to be addressed efficiently. …”
Get full text
Get full text
Get full text
Article -
20
Enhancing solid oxide fuel cell efficiency through advanced model identification using differential evolutionary mutation fennec fox algorithm
Published 2025“…The computational time of the proposed algorithm is 1.001 s, followed by the parent algorithm FFA (1.199 s) and some of the compared algorithms. …”
Get full text
Get full text
Get full text
Get full text
Article