70 search results - page 1 / 14 » Non-classical preference models in combinatorial problems: M... |
4OR
2004
13 years 4 months ago
2004
This is a summary of the most important results presented in the author's PhD thesis (Spanjaard, 2003). This thesis, written in French, was defended on 16 December 2003 and su...
IBIS
2006
13 years 4 months ago
2006
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
ALDT
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...
AAAI
2010
13 years 6 months ago
2010
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
EMMCVPR
2001
Springer
13 years 9 months ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...