| D15-1171 | function in Equation 1 is an NP-hard | combinatorial optimization | prob - lem . However , we show |
| C04-1091 | SMT ) is a computationally hard | combinatorial optimization | prob - lem . In this paper , |
| C04-1091 | solutions . Table 1 lists the | combinatorial optimization | problems in the domain of decoding |
| C94-2198 | problem can be considered as a | combinatorial optimization | problem to be solved with a simulated |
| P03-1057 | iterations , demonstrating that the | combinatorial optimization | by the hill-climbing algorithm |
| N06-1015 | continuous optimization over w and | combinatorial optimization | over yi . In order to transform |
| P03-1057 | Thus , this task is regarded as a | combinatorial optimization | problem of translation rules |
| C90-2054 | problem is formulated as one of | combinatorial optimization | , and a polynomial order algorithm |
| D08-1060 | source parse tree , or difficult | combinatorial optimizations | for the feature functions associated |
| N10-1117 | similar problem has been tackled in | combinatorial optimization | and MAP inference . Riedel and |
| P03-1057 | Combinatorial Optimization Most | combinatorial optimization | methods iterate changes in the |
| D09-1105 | Linear Ordering Problem In the | combinatorial optimization | literature , the maximization |
| D12-1102 | them . This decision task is a | combinatorial optimization | problem and can be solved using |
| D13-1152 | in the decoding stage , we use | combinatorial optimization | to find the dependency tree with |
| P01-1030 | straight TSP , but a wide range of | combinatorial optimization | problems ( including TSP ) can |
| J12-4002 | This equation is an instance of | combinatorial optimization | and solving it exactly is NP-complete |
| C90-2054 | paper we formulate this task as a | combinatorial optimization | problem and derive a set of recurrence |
| D13-1156 | relaxation based method combined with | combinatorial optimization | algorithms such as dynamic programming |
| C90-2054 | is formulated as the following | combinatorial optimization | problem \ -LSB- Matsunaga 86 |
| D15-1017 | be formalized as the following | combinatorial optimization | problem : 1 . A1 : Modular Function |
