350 search results - page 28 / 70 » Branching Programs for Tree Evaluation |
CP
2005
Springer
14 years 1 months ago
2005
Springer
The aggregation of individuals’ preferences into a single group outcome is both well-studied and fundamental within decision theory. Historically, though, a pervasive simplifica...
CP
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
CADE
2005
Springer
14 years 7 months ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We introduce potential fitness, a variant of fitness function that operates in the space of schemata and is applicable to tree-based genetic programing. The proposed evaluation ...
CP
2008
Springer
13 years 9 months ago
2008
Springer
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE...