VinhUni
Trang chủ
Thông điệp
Nhà khoa học
Bài báo khoa học
Đề tài khoa học
Sách, giáo trình
Tin tức
Thống kê
English
Bài báo khoa học
Trang chủ
Bài báo khoa học
Chi tiết bài báo
An Empirical Local Search for the Stable Marriage Problem
Tác giả:
Hoang Huu Viet, Le Hong Trang, SeungGwan Lee, TaeChoong Chung
482
0
PRICAI 2016
Quyển:
Trang:
Đường link/DOI:
https://www.springerprofessional.de/en/an-empirical-local-search-for-the-stable-marriage-problem/10568598
Minh chứng:
c11.An_Empirical_Local_Search_for_the_Stable_Marriage_Problem.pdf
Năm xuất bản:
2016
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ơn
BoB: an online coverage approach for multi-robot systems
Offsetting obstacles of any shape for robot motion planning
Lập trình C# cho ứng dụng cơ sở dữ liệu
Finding "Optimal" Stable Marriages with Ties via Local Search
A Bidirectional Local Search for the Stable Marriage Problem
A Searching for Strongly Egalitarian and Sex-Equal Stable Matchings
Ngôn ngữ hình thức và Automata
A Max-Min Conflict Algorithm for the Stable Marriage Problem
B-Theta*: an Efficient Online Coverage Algorithm for Autonomous Cleaning Robots
Univector field method-based multi-agent navigation for pursuit problem in obstacle environments
A min-conflicts algorithm for maximum stable matchings of the hospitals/residents problem with ties
Finding Maximum Stable Matchings for the Student-Project Allocation Problem with Preferences Over Projects
A shortlist-based bidirectional local search for the stable marriage problem
Mộ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
Optimally stable matchings for resource allocations
A max-conflicts-based heuristic search for the stable marriage problem with ties and incomplete lists
An efficient heuristic algorithm for solving the Student-Project Allocation with preferences over projects
A Heuristic Repair Algorithm for the Maximum Stable Marriage Problem with Ties and Incomplete Lists
A Heuristic Repair Algorithm for the Hospitals/Residents Problem with Ties
An approximate search algorithm for the student-internship allocation problem
An Improved AdaBoost Algorithm for Highly Imbalanced Datasets in the Co-Authorship Recommendation Problem
Finding Maximum Weakly Stable Matchings for Hospitals/Residents with Ties Problem via Heuristic Search
An efficient two-heuristic algorithm for the student-project allocation with preferences over projects