Adapting the elitism on greedy algorithm for variable strength combinatorial test cases generation

IET Software ◽  
2019 ◽  
Vol 13 (4) ◽  
pp. 286-294 ◽  
Author(s):  
Ameen A. BA Homaid ◽  
AbdulRahman A. Alsewari ◽  
Kamal Z. Zamli ◽  
Yazan A. Alsariera
1994 ◽  
Vol 144 ◽  
pp. 503-505
Author(s):  
R. Erdélyi ◽  
M. Goossens ◽  
S. Poedts

AbstractThe stationary state of resonant absorption of linear, MHD waves in cylindrical magnetic flux tubes is studied in viscous, compressible MHD with a numerical code using finite element discretization. The full viscosity tensor with the five viscosity coefficients as given by Braginskii is included in the analysis. Our computations reproduce the absorption rates obtained by Lou in scalar viscous MHD and Goossens and Poedts in resistive MHD, which guarantee the numerical accuracy of the tensorial viscous MHD code.


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

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


Sign in / Sign up

Export Citation Format

Share Document