Crossing Rivers Problem Solution with Breadth-First Search Approach

被引：1
|
作者：
Ratnadewi, R. [1 ]
Sartika, E. M. [1 ]
Rahim, R. [2 ]
Anwar, B. [3 ]
Syahril, M. [3 ]
Winata, H. [3 ]
机构：
[1] Maranatha Christian Univ, Elect Engn, Jalan Prof Drg Surya Sumantri 65, Bandung 40164, Indonesia
[2] Akad Perekam Med & Infokes Imelda, Dept Hlth Informat, Jl Bilal Ujung Medan 20116, Indonesia
[3] STMIK Triguna Dharma, Dept Syst Comp & Informat Syst, Jl Jenderal Abdul Haris Nasution 73, Medan 20219, Indonesia
来源：
2ND ANNUAL APPLIED SCIENCE AND ENGINEERING CONFERENCE (AASEC 2017) | 2018年 / 288卷
关键词：
D O I：
10.1088/1757-899X/288/1/012125
中图分类号：
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
Crossing river problem is one of the problems state and space that represents a state by using a rule to define the problem, to find solutions to state and space problem can use breadth first search method by conducting a search based on rule and condition given, it is expected with this research crossing river problem could be solved properly and optimally and also this research can be the basis of solving other similar problems by using breadth first search method, to model the situation and the problem space using Breadth First Search made an application with a programming language.
引用
收藏
页数：6
相关论文
共 50 条
  • [31] Load-Balanced Breadth-First Search on GPUs
    Zhu, Zhe
    Li, Jianjun
    Li, Guohui
    [J]. WEB-AGE INFORMATION MANAGEMENT, WAIM 2014, 2014, 8485 : 435 - 447
  • [32] Temporal resolution using a breadth-first search algorithm
    Dixon, C
    [J]. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1998, 22 (1-2) : 87 - 115
  • [33] An adaptive breadth-first search algorithm on integrated architectures
    Feng Zhang
    Heng Lin
    Jidong Zhai
    Jie Cheng
    Dingyi Xiang
    Jizhong Li
    Yunpeng Chai
    Xiaoyong Du
    [J]. The Journal of Supercomputing, 2018, 74 : 6135 - 6155
  • [34] SlimSell: A Vectorizable Graph Representation for Breadth-First Search
    Besta, Maciej
    Marending, Florian
    Solomonik, Edgar
    Hoefler, Torsten
    [J]. 2017 31ST IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2017, : 32 - 41
  • [35] Breadth-First Search with A Multi-Core Computer
    Belova, Maryia
    Ouyang, Ming
    [J]. 2017 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2017, : 579 - 587
  • [36] On dynamic breadth-first search in external-memory
    Meyer, Ulrich
    [J]. STACS 2008: PROCEEDINGS OF THE 25TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 2008, : 551 - 560
  • [37] Temporal resolution using a breadth-first search algorithm
    Clare Dixon
    [J]. Annals of Mathematics and Artificial Intelligence, 1998, 22 : 87 - 115
  • [38] Distributed breadth-first search LTL model checking
    Jiří Barnat
    Ivana Černá
    [J]. Formal Methods in System Design, 2006, 29 : 117 - 134
  • [39] Breadth-first search and the Andrews-Curtis conjecture
    Havas, G
    Ramsay, C
    [J]. INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2003, 13 (01) : 61 - 68
  • [40] Fast Breadth-First Search in Still Less Space
    Hagerup, Torben
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2019), 2019, 11789 : 93 - 105
12345