page loader
  1. Home
  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
Authors:
489    0
PKAW 2019, Lecture Notes in Computer Science
:     :
: https://link.springer.com/chapter/10.1007/978-3-030-30639-7_5
Publishing year: 2019
The web ontology rule language OWL 2 RL+ and its extensionsWORL: a nonmonotonic rule language for the semantic webAn Improved Depth-First Control Strategy for Query-Subquery Nets in Evaluating Queries to Horn Knowledge BasesAn Empirical Approach to Query-Subquery Nets with Tail-Recursion EliminationOn the Efficiency of Query-Subquery Nets with Right/Tail-Recursion Elimination in Evaluating Queries to Horn Knowledge BasesQuery-Subquery Nets with Stratified NegationC Programming LanguageQuery–subquery nets for Horn knowledge bases in first-order logicExtending Query-Subquery Nets for Deductive Databases under the Well-Founded SemanticsAn efficient solution for developing the overall management information system for Vinh universityIncorporating Stratified Negation into Query-Subquery Nets for Evaluating Queries to Stratified Deductive DatabasesFinding Maximum Stable Matchings for the Student-Project Allocation Problem with Preferences Over ProjectsIntegrating Multi-threading into Query-Subquery NetsAPPLYING MACHINE LEARNING TECHNIQUES ON IMBALANCED DATASETS FOR EARLY PREDICTION OF HIGH SCHOOL STUDENT DROPOUTMộ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ênA Heuristic Repair Algorithm for the Maximum Stable Marriage Problem with Ties and Incomplete ListsAn Empirical Heuristic Algorithm for Solving the Student-Project Allocation Problem with TiesFinding Maximum Weakly Stable Matchings for Hospitals/Residents with Ties Problem via Heuristic Search