Welcome![Sign In][Sign Up]
Location:
Search - stable marriage problem

Search list

[Other resourceMarriage

Description: 稳定婚姻:第一步配成一对夫妇, 即组成一个有序对, 以此作为问题的部分解, 以后每一步考虑一男一女, 如果将他们组成有序对并加入到部分解中, 不会引起不稳定, 则加入之 否则, 不组成有序对, 而是考虑另一对男女. 这样一步步地给部分解增加有序对, 直至得到完整解.在回溯的基础上,找到最优。 -stable marriage : first night of a couple that is a component ordered pair, as part of the problem solution, consider every step of a man and a woman, if they are composed of ordered pair and add to some solution will not give rise to instability, accession Otherwise, composed ordered pair, and another consideration is the right of men and women. such a step-by-step solutions to some increase ordered pair, until they have a complete solution. in the back, on the basis of finding optimal.
Platform: | Size: 1465 | Author: 小康 | Hits:

[Data structsMarriage

Description: 稳定婚姻:第一步配成一对夫妇, 即组成一个有序对, 以此作为问题的部分解, 以后每一步考虑一男一女, 如果将他们组成有序对并加入到部分解中, 不会引起不稳定, 则加入之 否则, 不组成有序对, 而是考虑另一对男女. 这样一步步地给部分解增加有序对, 直至得到完整解.在回溯的基础上,找到最优。 -stable marriage : first night of a couple that is a component ordered pair, as part of the problem solution, consider every step of a man and a woman, if they are composed of ordered pair and add to some solution will not give rise to instability, accession Otherwise, composed ordered pair, and another consideration is the right of men and women. such a step-by-step solutions to some increase ordered pair, until they have a complete solution. in the back, on the basis of finding optimal.
Platform: | Size: 1024 | Author: 小康 | Hits:

[SQL ServerStableMarriage

Description: 用sql语言求解稳定婚姻问题,包括游标和集合两种方式-With a stable marriage problem solving sql language, including cursor and collections in two ways
Platform: | Size: 315392 | Author: yangjiangshen | Hits:

[JSP/JavaGale-Shepley

Description: 求解稳定婚姻问题 从excel获取数据 判断该数据是否存在稳定的婚姻-To solve the stable marriage problem Get data from excel Judge whether the data is a stable marriage
Platform: | Size: 33792 | Author: zh | Hits:

[Data structsGale-Shapley

Description: 稳定匹配问题是算法理论中的典型问题之一,稳定婚姻匹配问题则是一种解决二部图匹配问题的模型。对稳定婚姻匹配问题进行了简单的阐述,并介绍了求解典型稳定婚姻问题的Gale-Shapley算法-Stable marriage matching problem is a model to solve the problem of the two graph matching. The problem of stable marriage matching is described briefly, and the Gale-Shapley algorithm is introduced.
Platform: | Size: 27648 | Author: 陈默 | Hits:

[Otherc1

Description: 算法设计课程设计,稳定婚姻匹配问题,源代码+ppt(Algorithm design curriculum design, stable marriage matching problem, the source code +ppt)
Platform: | Size: 1024 | Author: 深V | Hits:

[JSP/JavaMyLine

Description: 给定两直线,判断直线的状态,是否有交点,无需调试,简单易懂。(Given two straight lines to determine the state of the line, whether there is intersection, without debugging, easy to understand.The stable marriage problem based on matching algorithm, without debugging.)
Platform: | Size: 4096 | Author: 阿木木135 | Hits:

[Algorithmgale_shapley

Description: 稳定婚姻问题算法,给定n男n女,以及每个人对异性对象的喜好程度(按1至n排列)。安排男女结婚,使得不出现以下不稳定情形: 在n男n女中的存在两对夫妇(M, W)和(m, w),M男对w女喜好度大于现任妻子W女,并且w女对M男喜好度也大于现任丈夫m男。(In mathematics, economics, and computer science, the stable marriage problem (also stable matching problem or SMP) is the problem of finding a stable matching between two equally sized sets of elements given an ordering of preferences for each element. A matching is a mapping from the elements of one set to the elements of the other set. A matching is not stable if: There is an element A of the first matched set which prefers some given element B of the second matched set over the element to which A is already matched, and B also prefers A over the element to which B is already matched. In other words, a matching is stable when there does not exist any match (A, B) by which both A and B would be individually better off than they are with the element to which they are currently matched.)
Platform: | Size: 1024 | Author: peter1109 | Hits:

[AI-NN-PRGale_Shapley

Description: 实现稳定婚姻算法,解决在同等男士女士数量情况下的稳定配对问题(To achieve a stable marriage algorithm, to solve the problem of the stability of the same number of men in the case of the same)
Platform: | Size: 1024 | Author: Liu SJ | Hits:

CodeBus www.codebus.net