1158 search results - page 51 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
156
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
133
Voted
CP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
136
click to vote
ICDT
2005
ACM
15 years 10 months ago
2005
ACM
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
129
Voted
DIS
2007
Springer
15 years 10 months ago
2007
Springer
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...
159
Voted
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...