Sciweavers

2983 search results - page 7 / 597
» The group marriage problem
Sort
View
ICWL
2007
Springer
14 years 1 months ago
The Marriage of Rousseau and Blended Learning: An Investigation of 3 Higher Educational Institutions' Praxis
This paper sets out the central problem of current blended learning research that it does not have an appropriate focus on educational theory. The blended learning praxis in higher...
Esyin Chew, Norah Jones, David Turner
ACMSE
2010
ACM
13 years 5 months ago
Adaptive stable marriage algorithms
Although it takes O(n2 ) worst-case time to solve a stable marriage problem instance with n men and n women, a trivial O(n) algorithm suffices if all men are known to have identic...
John Dabney, Brian C. Dean
ICDCS
2009
IEEE
14 years 4 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
TCS
2008
13 years 7 months ago
A unified approach to finding good stable matchings in the hospitals/residents setting
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...
Christine Cheng, Eric McDermid, Ichiro Suzuki
CP
2006
Springer
13 years 9 months ago
Distributed Stable Matching Problems with Ties and Incomplete Lists
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
Ismel Brito, Pedro Meseguer