• Bài giảng Discrete Mathematics I - Chapter 6: CountingBài giảng Discrete Mathematics I - Chapter 6: Counting

    Introduction Example • In games: playing card, gambling, dices,. • How many allowable passwords on a computer system? • How many ways to choose a starting line-up for a football match?

    pdf72 trang | Chia sẻ: thuyduongbt11 | Ngày: 10/06/2022 | Lượt xem: 511 | Lượt tải: 0

  • Bài giảng Discrete Mathematics I - Chapter 8: Introduction to GraphsBài giảng Discrete Mathematics I - Chapter 8: Introduction to Graphs

    Contents 1 Graph definitions Terminology Special Simple Graphs 2 Representing Graphs and Graph Isomorphism Representing Graphs Graph Isomorphism 3 Exercise Graph Bipartie graph Isomorphism

    pdf34 trang | Chia sẻ: thuyduongbt11 | Ngày: 10/06/2022 | Lượt xem: 534 | Lượt tải: 0

  • Bài giảng Discrete Mathematics I - Chapter 10: TreesBài giảng Discrete Mathematics I - Chapter 10: Trees

    Contents 1 Introduction Properties of Trees 2 Tree Traversal 3 Applications of Trees Binary Search Trees Decision Trees 4 Spanning Trees 5 Minimum Spanning Trees Prim’s Algorithm Kruskal’s Algorithm

    pdf40 trang | Chia sẻ: thuyduongbt11 | Ngày: 10/06/2022 | Lượt xem: 548 | Lượt tải: 0

  • Bài giảng Discrete Mathematics I - Chapter 1: LogicsBài giảng Discrete Mathematics I - Chapter 1: Logics

    Logic Definition (Averroes) The tool for distinguishing between the true and the false. Definition (Penguin Encyclopedia) The formal systematic study of the principles of valid inference and correct reasoning. Definition (Discrete Mathematics - Rosen) Rules of logic are used to distinguish between valid and invalid mathematical arguments.

    pdf25 trang | Chia sẻ: thuyduongbt11 | Ngày: 10/06/2022 | Lượt xem: 576 | Lượt tải: 0

  • Giải thuật Chaotic Vortex Search cho bài toán tối ưu toàn cụcGiải thuật Chaotic Vortex Search cho bài toán tối ưu toàn cục

    Trong bài báo này, dựa trên nghiên cứu lý thuyết về giải thuật tìm kiếm tối ưu Vortex Search (VS), lý thuyết và ứng dụng lý thuyết Chaos vào họ giải thuật MetaHeuristics. Chúng tôi đề xuất cải tiến giải thuật VS bằng cách lai quy luật phát sinh tập ứng viên giải thuật VS với hàm Chaotic Bernoulli Map. Kết quả kiểm chứng trên tập 20 hàm Benchmark...

    pdf11 trang | Chia sẻ: thuyduongbt11 | Ngày: 10/06/2022 | Lượt xem: 304 | Lượt tải: 0

  • A novel quotient prediction for floating-point divisionA novel quotient prediction for floating-point division

    At present, floating-point operations are used as add-on functions in critical embedded systems, such as physics, aerospace system, nuclear simulation, image and digital signal processing, automatic control system and optimal control and financial, etc. However, floating-point division is slower than floating-point multiplication. To solve this pro...

    pdf14 trang | Chia sẻ: thuyduongbt11 | Ngày: 10/06/2022 | Lượt xem: 768 | Lượt tải: 0

  • Bài giảng Discrete structures for computer science - Chapter 1b: Predicate logicBài giảng Discrete structures for computer science - Chapter 1b: Predicate logic

    Contents 1 Predicate Logic: Motivation, Syntax, Proof Theory Need for Richer Language Predicate Logic as Formal Language Proof Theory of Predicate Logic 2 Semantics of Predicate Logic 3 Soundness and Completeness of Predicate Logic 4 Undecidability of Predicate Logic 5 Compactness of Predicate Calculus 6 Some problems for discussion

    pdf84 trang | Chia sẻ: thuyduongbt11 | Ngày: 10/06/2022 | Lượt xem: 563 | Lượt tải: 0

  • Bài giảng Discrete structures for computer science - Chapter 2: Proving methodsBài giảng Discrete structures for computer science - Chapter 2: Proving methods

    Introduction Definition A proof is a sequence of logical deductions from - axioms, and - previously proved theorems that concludes with a new theorem.

    pdf15 trang | Chia sẻ: thuyduongbt11 | Ngày: 10/06/2022 | Lượt xem: 530 | Lượt tải: 0

  • Bài giảng Discrete structures for computer science - Chapter 3: Sets and FunctionsBài giảng Discrete structures for computer science - Chapter 3: Sets and Functions

    Set Definition • Set is a fundamental discrete structure on which all discrete structures are built • Sets are used to group objects, which often have the same properties Example • Set of all the students who are currently taking Discrete Mathematics 1 course. • Set of all the subjects that K2011 students have to take in the first semester...

    pdf89 trang | Chia sẻ: thuyduongbt11 | Ngày: 10/06/2022 | Lượt xem: 527 | Lượt tải: 0

  • Bài giảng Discrete structures for computer science - Chapter 4: RelationsBài giảng Discrete structures for computer science - Chapter 4: Relations

    Relation Definition Let A and B be sets. A binary relation (quan h» hai ngôi) from a set A to a set B is a set R ⊆ A × B • Notations: (a; b) 2 R ! aRb • n-ary relations: R ⊂ A1 × A2 × · · · × An: Example Example Let A = fa; b; cg be the set of students, B = fl; c; s; g; dg be the set of the available optional courses. We can have relatio...

    pdf40 trang | Chia sẻ: thuyduongbt11 | Ngày: 10/06/2022 | Lượt xem: 539 | Lượt tải: 0