Open Access
MATEC Web Conf.
Volume 197, 2018
The 3rd Annual Applied Science and Engineering Conference (AASEC 2018)
Article Number 03007
Number of page(s) 4
Section Computer Science
Published online 12 September 2018
  1. G. Hermawan, “‘Implementasi Algoritma Greedy Best First Search pada Aplikasi Permainan Congklak untuk Optimasi Pemilihan Lubang dengan Pola Berfikir Dinamis,’” in Seminar Nasional Teknologi Informasi dan Multimedia (SNASTIA), pp. 1-6. (2012) [Google Scholar]
  2. M. F. Kasim, “Playing the game of Congklak with reinforcement learning,” in Proceedings of 2016 8th International Conference on Information Technology and Electrical Engineering: Empowering Technology for Better Future, ICITEE 2016, (2017) [Google Scholar]
  3. R. Rahim, A. S. Ahmar, A. P. Ardyanti, and D. Nofriansyah, “Visual Approach of Searching Process using Boyer-Moore Algorithm,” J. Phys. Conf. Ser., vol. 930, no. 1, p. 012001, (Dec. 2017) [CrossRef] [Google Scholar]
  4. R. Rahim, I. Zulkarnain, and H. Jaya, “A review: search visualization with Knuth Morris Pratt algorithm,” in IOP Conference Series: Materials Science and Engineering, vol. 237, no. 1, p. 012026.(2017) [CrossRef] [Google Scholar]
  5. R. Rahim, I. Zulkarnain, and H. Jaya, “Double hashing technique in closed hashing search process,” IOP Conf. Ser. Mater. Sci. Eng., vol. 237, no. 1, p. 012027, Sep. (2017) [CrossRef] [Google Scholar]
  6. R. Rahim, Nurjamiyah, and A. R. Dewi, “Data Collision Prevention with Overflow Hashing Technique in Closed Hash Searching Process,” J. Phys. Conf. Ser., vol. 930, no. 1, p. 012012, (Dec. 2017) [CrossRef] [Google Scholar]
  7. R. Rahim et al., “Block Architecture Problem with Depth First Search Solution and Its Application,” J. Phys. Conf. Ser., vol. 954, no. 1, p. 012006, (2018) [CrossRef] [Google Scholar]
  8. R. Rahim et al., “Searching Process with Raita Algorithm and its Application,” J. Phys. Conf. Ser., vol. 1007, no. 1, p. 012004, Apr. (2018) [CrossRef] [Google Scholar]
  9. R. Ratnadewi, E. M. Sartika, R. Rahim, B. Anwar, M. Syahril, and H. Winata, “Crossing Rivers Problem Solution with Breadth-First Search Approach,” in IOP Conference Series: Materials Science and Engineering, vol. 288, no. 1. (2018) [Google Scholar]
  10. Y. Zhou, W. Wang, D. He, and Z. Wang, “A fewest-turn-and-shortest path algorithm based on breadth-first search,” Geo-Spatial Inf. Sci., vol. 17, no. 4, pp. 201-207, (2014) [CrossRef] [Google Scholar]
  11. S. Beamer, K. Asanovic, and D. Patterson, “Searching for a Parent Instead of Fighting Over Children: A Fast Breadth-First Search Implementation for Graph500,” Tech. Rep. UCB/EECS-2011-117, EECS Dep. Univ. California, Berkeley, pp. 1-9, (2011) [Google Scholar]
  12. R. Zhou and E. A. Hansen, “Breadth-first heuristic search,” Artif. Intell., vol. 170, no. 4-5, pp. 385-408, (2006) [CrossRef] [Google Scholar]
  13. E. Zunic, A. Djedovic, and B. Zunic, “Software solution for optimal planning of sales persons work based on Depth-First Search and Breadth-First Search algorithms,” in 2016 39th International Convention on Information and Communication Technology, Electronics and Microelectronics, MIPRO 2016-Proceedings, pp. 1248-1253. (2016) [CrossRef] [Google Scholar]
  14. U. A. Acar, A. Charguéraud, and M. Rainey, “A Work-efficient Algorithm for Parallel Unordered Depth-first Search,” Proc. Int. Conf. High Perform. Comput. Networking, Storage Anal., p. 67:1--67:12, (2015) [Google Scholar]
  15. Sriadhi, “Model of the Material Inventory Management Using Multimedia based Information System,” in IOP Conference Series: Materials Science and Engineering, vol. 180, no. 1. (2017) [Google Scholar]
  16. R. K. Roslan and A. Ahmad, “3D Spatial Visualisation Skills Training Application for School Students Using Hologram Pyramid,” JOIV Int. J. Informatics Vis., vol. 1, no. 4, p. 170, (Nov. 2017) [CrossRef] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.