1977 search results - page 115 / 396 » The satisfactory partition problem |
170
click to vote
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
194
click to vote
AUSAI
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
191
click to vote
ACCV
2007
Springer
15 years 10 months ago
2007
Springer
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...
183
click to vote
SODA
2007
ACM
15 years 7 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
134
Voted
EOR
2006
15 years 6 months ago
2006
This paper presents a new data classification method based on mixed-integer programming. Traditional approaches that are based on partitioning the data sets into two groups perfor...