1725 search results - page 31 / 345 » Relaxed genetic programming |
121
Voted
JGO
2010
14 years 9 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
120
Voted
NIPS
2007
15 years 4 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
163
Voted
AIIA
1995
Springer
15 years 6 months ago
1995
Springer
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
114
click to vote
PRICAI
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. A successful case of applying brute-force search to functional programming automation is presented and compared with a conventional genetic programming method. From the i...
128
Voted
EUROGP
2003
Springer
15 years 8 months ago
2003
Springer
Teleo-reactive programs and the triple tower architecture have been proposed as a framework for linking perception and action in agents. The triple tower architecture continually u...