131 search results - page 5 / 27 » Solution Enumeration for Projected Boolean Search Problems |
GECCO
2005
Springer
14 years 4 days ago
2005
Springer
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
DATE
1999
IEEE
13 years 11 months ago
1999
IEEE
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
CP
2004
Springer
14 years 23 hour ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
COR
2006
13 years 6 months ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
INLG
2004
Springer
14 years 1 hour ago
2004
Springer
Abstract. We present a new approach to the generation of referring expressions containing attributive, type and relational properties combined by conjunctions, disjunctions and neg...