scholarly journals On Greedy Trie Execution

2012 ◽  
Vol DMTCS Proceedings vol. AQ,... (Proceedings) ◽  
Author(s):  
Zbigniew Gołębiewski ◽  
Filip Zagórski
Keyword(s):  
Lower Bound ◽  
Greedy Algorithm ◽  
International Audience ◽  
The Greedy Algorithm

International audience In the paper "How to select a looser'' Prodinger was analyzing an algorithm where $n$ participants are selecting a leader by flipping <underline>fair</underline> coins, where recursively, the 0-party (those who i.e. have tossed heads) continues until the leader is chosen. We give an answer to the question stated in the Prodinger's paper – what happens if not a 0-party is recursively looking for a leader but always a party with a smaller cardinality. We show the lower bound on the number of rounds of the greedy algorithm (for <underline>fair</underline> coin).

Implementasi Algoritma Dijkstra Pada Game Pacman

CCIT Journal ◽  
2019 ◽  
Vol 12 (2) ◽  
pp. 170-176
Author(s):  
Anggit Dwi Hartanto ◽  
Aji Surya Mandala ◽  
Dimas Rio P.L. ◽  
Sidiq Aminudin ◽  
Andika Yudirianto
Keyword(s):  
Artificial Intelligence ◽  
Greedy Algorithm ◽  
Dijkstra Algorithm ◽  
Testing Phase ◽  
A Value ◽  
Route Problem ◽  
Starting Point ◽  
The Greedy Algorithm

Pacman is one of the labyrinth-shaped games where this game has used artificial intelligence, artificial intelligence is composed of several algorithms that are inserted in the program and Implementation of the dijkstra algorithm as a method of solving problems that is a minimum route problem on ghost pacman, where ghost plays a role chase player. The dijkstra algorithm uses a principle similar to the greedy algorithm where it starts from the first point and the next point is connected to get to the destination, how to compare numbers starting from the starting point and then see the next node if connected then matches one path with the path). From the results of the testing phase, it was found that the dijkstra algorithm is quite good at solving the minimum route solution to pursue the player, namely by getting a value of 13 according to manual calculations

scholarly journals An Optimized Algorithm and Test Bed for Improvement of Efficiency of ESS and Energy Use

Electronics ◽  
2018 ◽  
Vol 7 (12) ◽  
pp. 388 ◽  
Author(s):  
Seung-Mo Je ◽  
Jun-Ho Huh
Keyword(s):  
Greedy Algorithm ◽  
Energy Use ◽  
Storage System ◽  
Lithium Ion ◽  
Energy Storage System ◽  
Test Bed ◽  
C Language ◽  
Improvement Plan ◽  
The Republic ◽  
The Greedy Algorithm

The Republic of Korea (ROK) has four distinct seasons. Such an environment provides many benefits, but also brings some major problems when using new and renewable energies. The rainy season or typhoons in summer become the main causes of inconsistent production rates of these energies, and this would become a fatal weakness in supplying stable power to the industries running continuously, such as the aquaculture industry. This study proposed an improvement plan for the efficiency of Energy Storage System (ESS) and energy use. Use of sodium-ion batteries is suggested to overcome the disadvantages of lithium-ion batteries, which are dominant in the current market; a greedy algorithm and the Floyd–Warshall algorithm were also proposed as a method of scheduling energy use considering the elements that could affect communication output and energy use. Some significant correlations between communication output and energy efficiency have been identified through the OPNET-based simulations. The simulation results showed that the greedy algorithm was more efficient. This algorithm was then implemented with C-language to apply it to the Test Bed developed in the previous study. The results of the Test Bed experiment supported the proposals.

scholarly journals Enhanced Particle Swarm Optimization for Effective Relay Nodes Deployment in Wireless Sensor Networks

2021 ◽  
Vol 13 (1) ◽  
pp. 53-73
Author(s):  
Bader Alshaqqawi ◽  
Sardar Anisul Haque ◽  
Mohammed Alreshoodi ◽  
Ibrahim Alsukayti
Keyword(s):  
Wireless Sensor Networks ◽  
Particle Swarm Optimization ◽  
Sensor Networks ◽  
Greedy Algorithm ◽  
Pso Algorithm ◽  
Optimization Process ◽  
Wireless Sensor ◽  
Optimization Approach ◽  
Swarm Optimization ◽  
The Greedy Algorithm

One of the critical design problems in Wireless Sensor Networks (WSNs) is the Relay Node Placement (RNP) problem. Inefficient deployment of RNs would have adverse effects on the overall performance and energy efficiency of WSNs. The RNP problem is a typical example of an NP-hard optimization problem which can be addressed using metaheuristics with multi-objective formulation. In this paper, we aimed to provide an efficient optimization approach considering the unconstrained deployment of energy-harvesting RNs into a pre-established stationary WSN. The optimization was carried out for three different objectives: energy consumption, network coverage, and deployment cost. This was approached using a novel optimization approach based on the integration of the Particle Swarm Optimization (PSO) algorithm and a greedy technique. In the optimization process, the greedy algorithm is an essential component to provide effective guidance during PSO convergence. It supports the PSO algorithm with the required information to efficiently alleviate the complexity of the PSO search space and locate RNs in the spots of critical significance. The evaluation of the proposed greedy-based PSO algorithm was carried out with different WSN scenarios of varying complexity levels. A comparison was established with two PSO variants: the classical PSO and a PSO hybridized with the pattern search optimizer. The experimental results demonstrated the significance of the greedy algorithm in enhancing the optimization process for all the considered PSO variants. The results also showed how the solution quality and time efficiency were considerably improved by the proposed optimization approach. Such improvements were achieved using a simple integration technique without adding to the complexity of the system and introducing additional optimization stages. This was more evident in the RNP scenarios of considerably large search spaces, even with highly complex and challenging setups.

scholarly journals Scheduling and Routing in Multi-Channel Allocation Based on the Greedy Algorithm for Wireless Mesh Network

2018 ◽  
Author(s):  
Weiwei Zhang ◽  
Jiafeng He ◽  
Guowang Gao ◽  
Lili Ren ◽  
Xuanjing Shen
Keyword(s):  
Greedy Algorithm ◽  
Wireless Mesh Network ◽  
Channel Allocation ◽  
Mesh Network ◽  
Wireless Mesh ◽  
The Greedy Algorithm

The greedy algorithm for shortest superstrings

2005 ◽  
Vol 93 (1) ◽  
pp. 13-17 ◽  
Author(s):  
Haim Kaplan ◽  
Nira Shafrir
Keyword(s):  
Greedy Algorithm ◽  
The Greedy Algorithm

scholarly journals A ranking model for the greedy algorithm and discrete convexity

2010 ◽  
Vol 132 (1-2) ◽  
pp. 393-407 ◽  
Author(s):  
Ulrich Faigle ◽  
Walter Kern ◽  
Britta Peis
Keyword(s):  
Greedy Algorithm ◽  
Discrete Convexity ◽  
Ranking Model ◽  
The Greedy Algorithm
Sign in / Sign up

Export Citation Format

Share Document