A novel mobile agent search algorithm

2002 ◽  
Author(s):  
W.-S.E. Chen ◽  
C.-W.R. Leng ◽  
Yao-Nan Lien
Keyword(s):  
Mobile Agent ◽  
Search Algorithm

A novel mobile agent search algorithm

2000 ◽  
Vol 122 (2-4) ◽  
pp. 227-240 ◽  
Author(s):  
Wen-Shyen E. Chen ◽  
Chun-Wu R. Leng ◽  
Yao-Nan Lien
Keyword(s):  
Mobile Agent ◽  
Search Algorithm

A novel mobile Agent search algorithm

1997 ◽  
pp. 162-173 ◽  
Author(s):  
Wen-Shyen E. Chen ◽  
Chun-Wu R. Leng
Keyword(s):  
Mobile Agent ◽  
Search Algorithm

Optimal broadcast scheduling method for VANETs: An adaptive discrete firefly approach

2020 ◽  
Vol 39 (6) ◽  
pp. 8125-8137
Author(s):  
Jackson J Christy ◽  
D Rekha ◽  
V Vijayakumar ◽  
Glaucio H.S. Carvalho
Keyword(s):  
Intelligent Transportation System ◽  
Search Algorithm ◽  
Mac Protocol ◽  
High Mobility ◽  
Optimal Solution ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Traffic Density ◽  
Scheduling Problem ◽  
Broadcast Scheduling

Vehicular Adhoc Networks (VANET) are thought-about as a mainstay in Intelligent Transportation System (ITS). For an efficient vehicular Adhoc network, broadcasting i.e. sharing a safety related message across all vehicles and infrastructure throughout the network is pivotal. Hence an efficient TDMA based MAC protocol for VANETs would serve the purpose of broadcast scheduling. At the same time, high mobility, influential traffic density, and an altering network topology makes it strenuous to form an efficient broadcast schedule. In this paper an evolutionary approach has been chosen to solve the broadcast scheduling problem in VANETs. The paper focusses on identifying an optimal solution with minimal TDMA frames and increased transmissions. These two parameters are the converging factor for the evolutionary algorithms employed. The proposed approach uses an Adaptive Discrete Firefly Algorithm (ADFA) for solving the Broadcast Scheduling Problem (BSP). The results are compared with traditional evolutionary approaches such as Genetic Algorithm and Cuckoo search algorithm. A mathematical analysis to find the probability of achieving a time slot is done using Markov Chain analysis.

Comparison of Meta-heuristic Algorithms on Benchmark Functions

2019 ◽  
Vol 2 (3) ◽  
pp. 508-517
Author(s):  
FerdaNur Arıcı ◽  
Ersin Kaya
Keyword(s):  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Optimization Algorithms ◽  
Gravitational Search Algorithm ◽  
Differential Evolution Algorithm ◽  
Population Based ◽  
Time Interval ◽  
Bee Colony ◽  
Different Characteristics

Optimization is a process to search the most suitable solution for a problem within an acceptable time interval. The algorithms that solve the optimization problems are called as optimization algorithms. In the literature, there are many optimization algorithms with different characteristics. The optimization algorithms can exhibit different behaviors depending on the size, characteristics and complexity of the optimization problem. In this study, six well-known population based optimization algorithms (artificial algae algorithm - AAA, artificial bee colony algorithm - ABC, differential evolution algorithm - DE, genetic algorithm - GA, gravitational search algorithm - GSA and particle swarm optimization - PSO) were used. These six algorithms were performed on the CEC’17 test functions. According to the experimental results, the algorithms were compared and performances of the algorithms were evaluated.

An Improved Version of Algebraic Codebook Search Algorithm for an AMR-WB Speech Coder

Informatica ◽  
2017 ◽  
Vol 28 (2) ◽  
pp. 403-414 ◽  
Author(s):  
Ming-Che Yeh ◽  
Cheng-Yu Yeh ◽  
Shaw-Hwa Hwang
Keyword(s):  
Search Algorithm ◽  
Speech Coder

Research on mobile Internet mobile agent system dynamic trust model for cloud computing

2019 ◽  
Vol 16 (7) ◽  
pp. 174-194 ◽  
Author(s):  
Weijin Jiang ◽  
Yang Wang ◽  
Yirong Jiang ◽  
Jiahui Chen ◽  
Yuhui Xu ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Mobile Agent ◽  
Trust Model ◽  
Mobile Internet ◽  
System Dynamic ◽  
Agent System ◽  
Dynamic Trust
Sign in / Sign up

Export Citation Format

Share Document