This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: j ] B = A X [ j +1] B ] but such a k may not exist – in fact, we wil 10/4/11 Dec 2, © UCF (Charles E. 66 More Shuffles • Iterated shuffle – A &0 B = A – A & k +1 B = (A ¤ [ k ] B) & B • Shuffle closure – A & * B = 7 k L 0 (A f k ] B) 10/4/11 Dec 2, © UCF (Charles E. 77 Crossover • Unconstrained crossover is defined by A & u B = { wz, yx  wx& A and yz&B} • Constrained crossover is defined by A &c B = { wz, yx  wx&A and yzW B, w = y, x = z } 10/4/11 Dec 2, © UCF (Charles E. 88 Who Cares? • People with no real life (me?) • Insertion and a related deletion operation are used in biomolecular computing and dynamical systems • Shuffle is used in analyzing concurrency as the arbitrary interleaving of parallel events • Crossover is used in genetic algorithms...
View
Full
Document
This note was uploaded on 10/03/2011 for the course COT 5310 taught by Professor Staff during the Spring '08 term at University of Central Florida.
 Spring '08
 Staff

Click to edit the document details