page loader
  1. Trang chủ
  2. Bài báo khoa học
  3. Chi tiết bài báo
A Max-Min Conflict Algorithm for the Stable Marriage Problem
Tác giả: Hoang Huu Viet
431    0
Lecture Notes in Computer Science
Quyển:     Trang:
Đường link/DOI: https://link.springer.com/chapter/10.1007/978-3-030-30639-7_5
Minh chứng: 1065-c15.pdf
Năm xuất bản: 2019
Cùng tác giả
Giải quyết bài toán đường đi bao phủ cho robot lau nhà bằng cách Cày zig-zag kết hợp tìm kiếm A* làm trơnBoB: an online coverage approach for multi-robot systemsOffsetting obstacles of any shape for robot motion planningLập trình C# cho ứng dụng cơ sở dữ liệuAn Empirical Local Search for the Stable Marriage ProblemFinding "Optimal" Stable Marriages with Ties via Local SearchA Bidirectional Local Search for the Stable Marriage ProblemA Searching for Strongly Egalitarian and Sex-Equal Stable MatchingsNgôn ngữ hình thức và AutomataB-Theta*: an Efficient Online Coverage Algorithm for Autonomous Cleaning RobotsUnivector field method-based multi-agent navigation for pursuit problem in obstacle environmentsA min-conflicts algorithm for maximum stable matchings of the hospitals/residents problem with tiesFinding Maximum Stable Matchings for the Student-Project Allocation Problem with Preferences Over ProjectsA shortlist-based bidirectional local search for the stable marriage problemMộ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ênOptimally stable matchings for resource allocationsA max-conflicts-based heuristic search for the stable marriage problem with ties and incomplete listsAn efficient heuristic algorithm for solving the Student-Project Allocation with preferences over projectsA Heuristic Repair Algorithm for the Maximum Stable Marriage Problem with Ties and Incomplete ListsA Heuristic Repair Algorithm for the Hospitals/Residents Problem with TiesAn approximate search algorithm for the student-internship allocation problemAn Improved AdaBoost Algorithm for Highly Imbalanced Datasets in the Co-Authorship Recommendation ProblemFinding Maximum Weakly Stable Matchings for Hospitals/Residents with Ties Problem via Heuristic Search