7006 search results - page 481 / 1402 » Approximation Algorithms |
179
Voted
SIGIR
2009
ACM
16 years 24 days ago
2009
ACM
This paper explores the problem of computing pairwise similarity on document collections, focusing on the application of “more like this” queries in the life sciences domain. ...
148
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
161
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
169
click to vote
AAAI
2006
15 years 7 months ago
2006
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
197
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Population size for EvolutionaryAlgorithms is usually an empirical parameter. We study the population size from aspects of fitness landscapes’ ruggedness and Probably ...