Advanced
Advanced

Browsing by Author Hoang, Chi Thanh

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 5 of 5
  • [doi 10.1109%2Fgrc.2012.6468693] Nguyen, Loan T.T.; Vo, Bay; Hong, Tzung-Pei; Thanh, Hoang Chi -- [IEEE 2012 IEEE International Conference on Granular Computing (GrC-2012) - Hangzhou, China (2012.08.1.pdf.jpg
  • Conference paper

  • A fast algorithm for classification based on association rules

    • Authors: Nguyen, Loan T. T; Vo, Bay; Hong, Tzung-Pei; Hoang, Chi Thanh (2012)

  • In this paper, we propose a new method for mining class-association rules using a tree structure. Firstly, we design a tree structure for storing frequent itemsets of datasets. Some theorems for pruning nodes and computing information in the tree are then developed. We then propose an efficien algorithm for mining CARs based on them. Experimental results show that our approach is more efficient than those used previously.
  • 194.pdf.jpg
  • Article

  • Control problem on timed place/transition nets

    • Authors: Hoang, Chi Thanh (2004)

  • Design, analysis and control of large system s are complicated because of their state space explosion and behaviours. In this paper we solve the control problem on Timed Place/Transition nets by piopoòing a concurrent composition, which is a good solution for system s design. We also show that the safety and aliveness of Timed Place/Transition nets arc preserved by the controller. Increase of concurrency in composed Timed Place/Transition nets is also considered.
  • 175.pdf.jpg
  • Article

  • “Shift-Left” Algorithms transforming sequential processes into concurrent ones

    • Authors: Hoang, Chi Thanh (2006)

  • Finding concurrent processes of a system is an objective of system controls, because it shows an optimal way to perform processes. In this paper we build two iterative algorithms for transforming sequential processes of a reliance alphabet and of a Place/Transition net into concurrent ones. The complexity of these algorithms is also considered.
  • 165.pdf.jpg
  • Article

  • Some methods for transforming sequential processes into concurrent ones

    • Authors: Hoang, Chi Thanh (2007)

  • In this paper we investigate and build up three methods for transforming sequential processes of a net system into concurrent ones. These methods are based on: trace languages, shift-left and case graphs. They are also presented by detail algonthms and can be applied to other models of concurrent systems.
  • 57.pdf.jpg
  • Article

  • Some new combinatorial algorithms with appropriate representations of solutions

    • Authors: Hoang, Chi Thanh; Nguyen, Quang Thanh (2012)

  • Combinatorial problems are those problems, whose requirements are an association of some conditions. The construction of efficient algorithms to find solutions of the combinatorial problems is still an interesting matter. In this paper, we choose appropriate representations for desirable solutions of the permutation problem and the partition problem. Then we sort the representations of a problem's solutions in the alphabetical order. Owing to it we construct two new algorithms for quickly finding all solutions of these problems.

    Readership Map

    ABSTRACTS VIEWS

    45535425

    VIEWS & DOWNLOAD

    27616500

    Content Distribution

Browsing by Author Hoang, Chi Thanh

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 5 of 5
  • [doi 10.1109%2Fgrc.2012.6468693] Nguyen, Loan T.T.; Vo, Bay; Hong, Tzung-Pei; Thanh, Hoang Chi -- [IEEE 2012 IEEE International Conference on Granular Computing (GrC-2012) - Hangzhou, China (2012.08.1.pdf.jpg
  • Conference paper

  • A fast algorithm for classification based on association rules

    • Authors: Nguyen, Loan T. T; Vo, Bay; Hong, Tzung-Pei; Hoang, Chi Thanh (2012)

  • In this paper, we propose a new method for mining class-association rules using a tree structure. Firstly, we design a tree structure for storing frequent itemsets of datasets. Some theorems for pruning nodes and computing information in the tree are then developed. We then propose an efficien algorithm for mining CARs based on them. Experimental results show that our approach is more efficient than those used previously.
  • 194.pdf.jpg
  • Article

  • Control problem on timed place/transition nets

    • Authors: Hoang, Chi Thanh (2004)

  • Design, analysis and control of large system s are complicated because of their state space explosion and behaviours. In this paper we solve the control problem on Timed Place/Transition nets by piopoòing a concurrent composition, which is a good solution for system s design. We also show that the safety and aliveness of Timed Place/Transition nets arc preserved by the controller. Increase of concurrency in composed Timed Place/Transition nets is also considered.
  • 175.pdf.jpg
  • Article

  • “Shift-Left” Algorithms transforming sequential processes into concurrent ones

    • Authors: Hoang, Chi Thanh (2006)

  • Finding concurrent processes of a system is an objective of system controls, because it shows an optimal way to perform processes. In this paper we build two iterative algorithms for transforming sequential processes of a reliance alphabet and of a Place/Transition net into concurrent ones. The complexity of these algorithms is also considered.
  • 165.pdf.jpg
  • Article

  • Some methods for transforming sequential processes into concurrent ones

    • Authors: Hoang, Chi Thanh (2007)

  • In this paper we investigate and build up three methods for transforming sequential processes of a net system into concurrent ones. These methods are based on: trace languages, shift-left and case graphs. They are also presented by detail algonthms and can be applied to other models of concurrent systems.
  • 57.pdf.jpg
  • Article

  • Some new combinatorial algorithms with appropriate representations of solutions

    • Authors: Hoang, Chi Thanh; Nguyen, Quang Thanh (2012)

  • Combinatorial problems are those problems, whose requirements are an association of some conditions. The construction of efficient algorithms to find solutions of the combinatorial problems is still an interesting matter. In this paper, we choose appropriate representations for desirable solutions of the permutation problem and the partition problem. Then we sort the representations of a problem's solutions in the alphabetical order. Owing to it we construct two new algorithms for quickly finding all solutions of these problems.