This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 2 Example s Let f (x) = x 2 be the objective function, and we want to find x such that f(x) is maximized. s x is in 3-bit string (L=3) s Obviously, 111 is optimal s If it is an one-bit deceptive problem, one of the following cases is to be fulfiled: ( ) ( ) ( ) ( ) ( ) ( ) < < < * * * * 1 * * * 1 * * * 1 * * f f f f f f (any one condition) Example s It can be computed that (according to the objective function): s f(**0) = [f(000)+f(010)+f(100)+f(110)]/4=14 s f(**1) = [f(001)+f(011)+f(101)+f(111)]/4=21 s Similarly, we have s f(*0*)=10.5 s f(*1*)=24.5 s f(0**)=3.5 s f(1**)=31.5 s Hence, the problem is not deceptive....
View Full Document
This note was uploaded on 05/01/2011 for the course ELECTRICAL EE5602 taught by Professor Xuequan during the Spring '11 term at City University of Hong Kong.
- Spring '11