13 search results - page 1 / 3 » aaim 2006 |
AAIM
2006
Springer
14 years 7 days ago
2006
Springer
AAIM
2006
Springer
14 years 7 days ago
2006
Springer
AAIM
2006
Springer
14 years 7 days ago
2006
Springer
AAIM
2006
Springer
14 years 7 days ago
2006
Springer
Abstract. We derive a polynomial time algorithm to compute a stable solution in a mixed matching market from an auction procedure as presented by Eriksson and Karlander [5]. As a s...
AAIM
2006
Springer
14 years 7 days ago
2006
Springer
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...