Sciweavers

1162 search results - page 154 / 233
» Cartesian genetic programming
Sort
View
EVOW
2005
Springer
14 years 1 months ago
Evolving Reversible Circuits for the Even-Parity Problem
Reversible computing basically means computation with less or not at all electrical power. Since the standard binary gates are not usually reversible we use the Fredkin gate in ord...
Mihai Oltean
FSKD
2005
Springer
120views Fuzzy Logic» more  FSKD 2005»
14 years 1 months ago
Impact on the Writing Granularity for Incremental Checkpointing
Incremental checkpointing is an cost-efficient fault tolerant technique for long running programs such as genetic algorithms. In this paper, we derive the equations for the writing...
Junyoung Heo, Xuefeng Piao, Sangho Yi, Geunyoung P...
GECCO
2003
Springer
121views Optimization» more  GECCO 2003»
14 years 28 days ago
Evolving Hogg's Quantum Algorithm Using Linear-Tree GP
Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In thi...
André Leier, Wolfgang Banzhaf
SP
2000
IEEE
13 years 11 months ago
Searching for a Solution: Engineering Tradeoffs and the Evolution of Provably Secure Protocols
Tradeoffs are an important part of engineering security. Protocol security is important. So are efficiency and cost. This paper provides an early framework for handling such aspec...
John A. Clark, Jeremy L. Jacob
EUSFLAT
2007
134views Fuzzy Logic» more  EUSFLAT 2007»
13 years 9 months ago
Selection of Optimal Set of Diagnostic Tests with Use of Evolutionary Approach in Intelligent Systems
This paper concerns problem of selection of optimal subset of irredundant unconditional diagnostic tests by means of evolutionary approach. The method of correction of features’...
A. E. Yankovskaya, Y. R. Tsoy