Dana Vrajitoru
¬
®
Optimization Examples
f(
x
1
,
x
2
,
x
3
) =
x
1
2
+
x
2
2
+
x
3
2
A SAT expression
We can assume that
proc
i
computes
x
i
,
i
= 1, 2, 3.
For
proc
1
, we can store the values of
x
2
and
x
3
instead of their genetic representation.
Each process guesses the values of the variables in a part of the boolean tree.
We can replace the subtrees from the samples with the values obtained by their evaluation.
IUSB
,
Computer & Information Sciences