The link between r-contiguous detectors and k-CNF satisfiability

Thomas Stibor*, Jonathan Timmis, Claudia Eckert

*Awdur cyfatebol y gwaith hwn

Allbwn ymchwil: Pennod mewn Llyfr/Adroddiad/Trafodion CynhadleddTrafodion Cynhadledd (Nid-Cyfnodolyn fathau)

19 Dyfyniadau(SciVal)

Crynodeb

In the context of generating detectors using the r-contiguous matching rule, questions have been raised at the efficiency of the process. We show that the problem of generating r-contiguous detectors can be transformed in a k-CNF satisfiability problem. This insight allows for the wider understanding of the problem of generating r-contiguous detectors. Moreover, we apply this result to consider questions relating to the complexity of generating detectors, and when detectors are generable.

Iaith wreiddiolSaesneg
Teitl2006 IEEE Congress on Evolutionary Computation, CEC 2006
CyhoeddwrIEEE Press
Tudalennau491-498
Nifer y tudalennau8
ISBN (Argraffiad)0780394879, 9780780394872
StatwsCyhoeddwyd - 2006
Digwyddiad2006 IEEE Congress on Evolutionary Computation, CEC 2006 - Vancouver, BC, Canada
Hyd: 16 Gorff 200621 Gorff 2006

Cyfres gyhoeddiadau

Enw2006 IEEE Congress on Evolutionary Computation, CEC 2006

Cynhadledd

Cynhadledd2006 IEEE Congress on Evolutionary Computation, CEC 2006
Gwlad/TiriogaethCanada
DinasVancouver, BC
Cyfnod16 Gorff 200621 Gorff 2006

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'The link between r-contiguous detectors and k-CNF satisfiability'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn