Search Results - intelligence call ((graph algorithm) OR (path algorithm))
Search alternatives:
- intelligence call »
- graph algorithm »
- path algorithm »
-
1
Optimisation of Environmental Risk Assessment Architecture using Artificial Intelligence Techniques
Published 2024“…By contrast, the results of the safe path selection model were compared with the results obtained using Dijkstra's algorithm and the Floyd-Warshall algorithm. …”
thesis::doctoral thesis -
2
Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm
Published 2020“…This paper investigates the swarm intelligence behaviour represented by a population-based approach called the bat algorithm (BA) to find the smallest set of nodes that dominate the graph. …”
Get full text
Get full text
Article -
3
False path identification algorithm framework for nonseparable controller-data path circuits
Published 2016Get full text
Get full text
Conference or Workshop Item -
4
-
5
Hybrid bat algorithm for minimum dominating set problem
Published 2017“…In this paper, the stochastic search represented by hybrid swarm intelligence algorithm to find the smallest set of nodes that dominate the graph. …”
Get full text
Get full text
Article -
6
-
7
-
8
Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman
Published 2020“…Even though A* is the most popular algorithm amongst game developers, it's hardly the best algorithm in finding the true shortest path. …”
Get full text
Get full text
Thesis -
9
-
10
Improved Dynamic Ant Colony System (DACS) on Symmetric Traveling Salesman Problem (TSP).
Published 2007Get full text
Get full text
Conference or Workshop Item -
11
Multi agent quality of service routing based on scheme ant colony optimization algorithm
Published 2014“…This study also introduces a new probe-based procedure for discovery and setup QoS path for real-time traffic. The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
Get full text
Get full text
Thesis -
12
Adaptable decentralized orchestration engine for block structured non-transactional workflow in service oriented architecture.
Published 2011“…The latter considers the frequent-path adaptability and both of them together satisfy both frequent-path and proportionalfragment adaptability aspects; v) A Fuzzy Decentralization Decision Making algorithm (FDDM) is presented based on the fuzzy logic to choose a suitable method of decentralization that satisfies the three adaptability aspects frequent-path,proportional- fragment and available-bandwidth; and, vi) an algorithm is introduced for wiring of dynamic fragments. …”
Get full text
Get full text
Thesis -
13
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…Its optimality has inspired the development of a metaheuristic algorithm called Heuristic Kalman Algorithm (HKA) in 2009. …”
Get full text
Get full text
Thesis -
14
-
15
Neutralisation state driven single-agent search strategy for solving constraint satisfaction problem / Saajid Akram Ahmed Abuluaih
Published 2019“…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 -
16
Ontology based approach to Fuzzy student model design
Published 2014“…An important component of these elearning systems in use today is called the intelligent tutoring system (ITS). ITS is a software system designed using artificial intelligent techniques (comprising of Fuzzy Logic, Neural-Networks, Bayesian networks, Ontology, Genetic Algorithms and Software Agents) to provide a personalized tutoring adaptable to each student based on his/her profile or characteristics. …”
Get full text
Get full text
Article -
17
Ant-based vehicle congestion avoidance framework using vehicular networks / Mohammad Reza Jabbarpour Sattari
Published 2015“…Previous researches concentrated on using static algorithms to find the shortest path in VTRSs. However, providing a shortest path without considering other factors such as congestion, accidents, obstacles, travel time and speed is not a proper solution for vehicle traffic congestion problem. …”
Get full text
Get full text
Thesis -
18
An Efficient Route Selection Based on AODV Algorithm for VANET
Published 2016“…Every day a large number of human lives are lost with many sustaining a disability as a result of their injury due to car accidents and delay in calling the rescue services. Recently, intelligent transportation systems (ITS) have emerged as an efficient way of improving interpretation of transportation systems and enhancing travel safety. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
19
An Efficient Route Selection based on AODV Algorithm for VANET
Published 2016“…Every day a large number of human lives are lost with many sustaining a disability as a result of their injury due to car accidents and delay in calling the rescue services. Recently, Intelligent Transportation Systems (ITS) have emerged as an efficient way of improving interpretation of transportation systems and enhancing travel safety. …”
Get full text
Get full text
Get full text
Article -
20
A Systematic Survey on the Research of AI-predictive Models for Wastewater Treatment Processes
Published 2023“…Conclusion: ANN with MLP approach on BP algorithm become a supervised neural network called BPNN is the most used AI modeling for WWTP and around 40% of the experimental research done with BPNN. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article