1277 search results - page 78 / 256 » Terminating Decision Algorithms Optimally |
136
click to vote
COMPGEOM
1998
ACM
15 years 7 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
122
click to vote
EMNLP
2009
15 years 1 months ago
2009
System combination has emerged as a powerful method for machine translation (MT). This paper pursues a joint optimization strategy for combining outputs from multiple MT systems, ...
156
click to vote
CPAIOR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
100
click to vote
ASPDAC
2005
ACM
15 years 5 months ago
2005
ACM
— In this paper we present a scheme for reducing the amount of synchronization overhead needed between components, after HW/SW partitioning, to preserve the original control flo...
151
click to vote
JCP
2007
15 years 3 months ago
2007
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...