5757 search results - page 406 / 1152 » Dynamic Policy Programming |
183
click to vote
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
164
click to vote
ISER
1997
Springer
15 years 11 months ago
1997
Springer
We describe an integrated system for programming part-mating and contact tasks using simulation. A principal goal of this work is to make robotic programming easy and intuitive fo...
208
click to vote
AGILEDC
2004
IEEE
15 years 10 months ago
2004
IEEE
Through his law, "adding manpower to a late software project makes it later," Brooks asserts that the assimilation, training, and intercommunication costs of adding new ...
177
click to vote
SPIN
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. In this article, we address the problem of statically determining an approximation of the communication topology of concurrent programs. These programs may contain dynami...
181
click to vote
GECCO
2010
Springer
15 years 8 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...