5757 search results - page 177 / 1152 » Dynamic Policy Programming |
178
click to vote
MP
2006
15 years 6 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
174
click to vote
IJACTAICIT
2010
15 years 3 months ago
2010
Program slicing is a promising technique for providing automated support for various important software engineering activities. There exists hundreds of scientific studies on the ...
189
click to vote
WSC
1998
15 years 7 months ago
1998
We have taken a NIST molecular dynamics simulation program (md3), which was configured as a single sequential process running on a CRAY C90 vector supercomputer, and parallelized ...
167
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This work shows asymptotic convergence to global optima for a family of dynamically scaled genetic programming systems where the underlying population consists of a fixed number o...
220
click to vote
BMCBI
2002
15 years 6 months ago
2002
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...