500 search results - page 45 / 100 » A parallel quadratic programming method for dynamic optimiza... |
CP
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
ACL
2011
14 years 2 months ago
2011
We describe an exact decoding algorithm for syntax-based statistical translation. The approach uses Lagrangian relaxation to decompose the decoding problem into tractable subprobl...
102
click to vote
CONSTRAINTS
2006
14 years 11 months ago
2006
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
GECCO
2010
Springer
15 years 1 months ago
2010
Springer
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
101
click to vote
ICML
2000
IEEE
15 years 3 months ago
2000
IEEE
The reinforcement learning problem can be decomposed into two parallel types of inference: (i) estimating the parameters of a model for the underlying process; (ii) determining be...