506 search results - page 21 / 102 » Automated Search for Heuristic Functions |
ISVLSI
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper we present a new method for quasiexact optimization of BDDs using relaxed ordered best-first search. This general method is applied to BDD minimization. In contrast...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Constrained continuous optimization is still an interesting field of research. Many heuristics have been proposed in the last decade. Most of them are based on penalty functions....
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
FLOPS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We present a lightweight, automated tool for specificationbased testing of declarative programs written in the functional logic programming language Curry and emphasize t...