4469 search results - page 249 / 894 » Dynamic Program Slicing |
177
click to vote
CP
2005
Springer
16 years 4 days 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...
173
click to vote
GECCO
2005
Springer
2005
Springer
Probing for limits to building block mixing with a tunably-difficult problem for genetic programming
16 years 1 days 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 ...
176
Voted
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...
160
click to vote
ISER
1997
Springer
15 years 10 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...
201
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 ...