4843 search results - page 40 / 969 » The Shortcut Problem - Complexity and Approximation |
EMNLP
2006
13 years 10 months ago
2006
The end-to-end performance of natural language processing systems for compound tasks, such as question answering and textual entailment, is often hampered by use of a greedy 1-bes...
FSTTCS
2006
Springer
14 years 12 days ago
2006
Springer
Abstract. Stochastic optimization is a leading approach to model optimization problems in which there is uncertainty in the input data, whether from measurement noise or an inabili...
ENTCS
2008
13 years 8 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
HEURISTICS
1998
13 years 8 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
ISAAC
2004
Springer
14 years 2 months ago
2004
Springer
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...