51 search results - page 1 / 11 » Faster Algorithms for Stable Allocation Problems |
ALGORITHMICA
2010
13 years 5 months ago
2010
We consider a high-multiplicity generalization of the classical stable matching problem known as the stable allocation problem, introduced by Ba
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
JCO
2008
13 years 5 months ago
2008
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
EAAI
2010
13 years 4 days ago
2010
A model of honey bee social foraging is introduced to create an algorithm that solves a class of optimal resource allocation problems. We prove that if several such algorithms (&q...
ISBI
2011
IEEE
12 years 9 months ago
2011
IEEE
We develop a new algorithm to segment the hippocampus from MR images. Our method uses a new classifier ensemble algorithm to correct segmentation errors produced by a multi-atlas...