1999 search results - page 147 / 400 » Finding Reductions Automatically |
107
Voted
EC
2008
14 years 9 months ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
We present a flexible new optimization framework for finding effective, reliable pseudo-relevance feedback models that unifies existing complementary approaches in a principled wa...
60
Voted
CNSM
2010
14 years 8 months ago
2010
Abstract--In this paper, we present demand-side energy management under real-time demand-response pricing as a task scheduling problem which is NP-hard. Using minmax as the objecti...
109
click to vote
IWPEC
2010
Springer
14 years 8 months ago
2010
Springer
RANK AGGREGATION is important in many areas ranging from web search over databases to bioinformatics. The underlying decision problem KEMENY SCORE is NP-complete even in case of fo...
EMNLP
2009
14 years 8 months ago
2009
Machine involvement has the potential to speed up language documentation. We assess this potential with timed annotation experiments that consider annotator expertise, example sel...