page loader
  1. Home
  2. Bài báo khoa học
  3. Chi tiết bài báo
A max-conflicts based heuristic search for the stable marriage problem with ties and incomplete lists.
Authors: Hoang Huu Viet, Nguyen Thi Uyen, SeungGwan Lee, TaeChoong Chung, Le Hong Trang:
429    1
Heuristics
:     :
: https://dblp.uni-trier.de/db/journals/heuristics/heuristics27.html
: 1079-j10-article-amax-conflictsbasedheuristicse.pdf
Publishing year: 2021
International Journal of Advanced Research in Artificial Intelligence (IJARAI), 3(9), 2014.Vietnamese word segmentation based on the mutual information among the syllablesPath Finding Algorithms for Autonomous Robots Based on Reinforcement LearningActive teaching methods applied in training system towards CDIO educational frameworkPDCA cycle for higher education quality assessment and accreditationPREDICTING STUDENT'S ACADEMIC PERFORMANCE BY APPLYING DATA MINING TECHNIQUE.A Max-Min Conflict Algorithm for the Stable Marriage Problem A min-conflicts algorithm for maximum stable matchings of the hospitals/residents problem withMột thuật toán tìm kiếm cục bộ hiệu quả giải bài toán phân công địa điểm thực tập cho sinh viên An efficient heuristics algorithm for solving the Student-Project Allocation with Preferences over ProjectsA Heuristic Repair Algorithm for the Maximum Stable Marriage Problem with Ties and Incomplete ListsAn efficient algorithm to find a maximum weakly stable matching for SPA-ST problem Quantum Social Computing Approaches for Influence MaximizationA Heuristic Algorithm for Student-Project Allocation ProblemAn efficient algorithm to find a maximum weakly stable matching for SPA-ST problem Improved Streaming Algorithm for Minimum Cost Submodular Cover ProblemAn efficient two-heuristic algorithm for the student-project allocation with preferences over projects