UCSY's Research Repository

Browsing International Conference on Computer Applications (ICCA) by Author "Hlaing, Zar Chi Su Su"

Browsing International Conference on Computer Applications (ICCA) by Author "Hlaing, Zar Chi Su Su"

Sort by: Order: Results:

  • Hlaing, Zar Chi Su Su; Khine, May Aye (Ninth International Conference On Computer Applications (ICCA 2011), 2011-05-05)
    Traveling salesman problem (TSP) is one of the most famous combinatorial optimization (CO) problems, which has wide application background. Ant Colony Optimization (ACO) is a heuristic algorithm which has been proven ...
  • Hlaing, Zar Chi Su Su; Khaing, Myo (Proceedings of the Eighteenth International Conference On Computer Applications (ICCA 2020), 2020-02-28)
    With the web advancements are rapidly developing, the greater part of individuals makes their transactions on web, for example, searching through data, banking, shopping, managing, overseeing and controlling dam ...
  • Hlaing, Zar Chi Su Su; Khine, May Aye (Tenth International Conference On Computer Applications (ICCA 2012), 2012-02-28)
    The Ant Colony Optimization (ACO) is a metaheuristic algorithm used for combinatorial optimization problems. It is a good choice for many hard combinatorial problems because it is more efficient and produces better ...
  • Hlaing, Zar Chi Su Su (Fourteenth International Conference On Computer Applications (ICCA 2016), 2016-02-25)
    Ant Colony Optimization (ACO) is a useful approach for finding near optimal solutions in polynomial time for Nondeterministic Polynomial time (NP) problems. Traveling salesman problem (TSP) is a typical NP hard problem ...
  • Zaw, Wai Phyoe; Hlaing, Zar Chi Su Su (ICCA, 2021-02-25)
    Nowadays, a lot of information is valuable for people who want to predict and decide the market or economic or political or many different areas. Because of the information age, customers are also no longer interested in ...

Search Repository



Browse

My Account