Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2983
search results - page 5 / 597
»
The group marriage problem
Sort
relevance
views
votes
recent
update
View
thumb
title
24
click to vote
JCO
2008
78
views
more
JCO 2008
»
Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
13 years 7 months ago
Download
www.dcs.gla.ac.uk
Robert W. Irving, David Manlove
claim paper
Read More »
11
click to vote
TCS
2010
106
views
Theoretical Computer Science
»
more
TCS 2010
»
Size versus stability in the marriage problem
13 years 5 months ago
Download
www.dcs.gla.ac.uk
Péter Biró, David Manlove, Shubham M...
claim paper
Read More »
14
click to vote
ATAL
2011
Springer
172
views
Intelligent Agents
»
more
ATAL 2011
»
Procedural fairness in stable marriage problems
12 years 7 months ago
Download
www.math.unipd.it
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
claim paper
Read More »
23
click to vote
ALGORITHMICA
2010
159
views
more
ALGORITHMICA 2010
»
Almost Stable Matchings by Truncating the Gale-Shapley Algorithm
13 years 7 months ago
Download
www.cs.helsinki.fi
We show that the ratio of matched individuals to blocking pairs grows linearly with the number of propose
Patrik Floréen, Petteri Kaski, Valentin Pol...
claim paper
Read More »
14
click to vote
CP
2005
Springer
57
views
Artificial Intelligence
»
more
CP 2005
»
Specialised Constraints for Stable Matching Problems
14 years 1 months ago
Download
lia.deis.unibo.it
Abstract. The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched ...
Chris Unsworth, Patrick Prosser
claim paper
Read More »
« Prev
« First
page 5 / 597
Last »
Next »