4469 search results - page 249 / 894 » Dynamic Program Slicing |
CP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
GECCO
2005
Springer
2005
Springer
Probing for limits to building block mixing with a tunably-difficult problem for genetic programming
14 years 1 months ago
This paper describes a tunably-difficult problem for genetic programming (GP) that probes for limits to building block mixing and assembly. The existence of such a problem can be ...
CPAIOR
2010
Springer
14 years 1 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...
ISER
1997
Springer
14 years 11 days 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...
AGILEDC
2004
IEEE
13 years 12 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 ...