[Higlited Topic here]

=== even-n-parity with only EQ and XOR logic ===

[related basic research on this topic]

(OK => Gecco2004ws_CountingSolutions.pdf)
M. Collins (2004)
"Counting Solutions in Reduced Boolean Parity" GECCO 2004 --- olmost equivalent
and better version of [2]



M. Collins (2004)
Monte Carlo Sampling and counting Solutions in Reduced Boolean Parity
Monte-Carlo-Sampling-and-counting-Solutions-in-Reduced-Boolean-Parity
EDI-INF-RR-0240
http://www.inf. ed.ac.uk/publications/report -> only list not paper

(OK=> langdon98boolean.pdf)
W. Langdon. R. Poli. 
Boolean Functions Fitness Spaces
1997. University of Birmingham Technical Report
CSRP-98-16.

W. Langon and R. Poli (1997)
Boolean Func tions Fitness Spaces
University of birmingham Tech Report -- CSRP-98-16
---
T. Yu and J. Miller (2002)
Finding needles ... pp. 13-25


even-12-parity more than 55 success from 100 runs each of a only max of 10,000 iterations
while with random search never succeeded in 4,000,000 trials.

(OK => neurtrality.pdf)
T. Yu and J. Miller (2001)
Neutrality and the Evolvability of Boolean Function Landscape
Proc. of the 4th European Conference on Genetic Programming 
pp. 204-217   => let's google search


T. Yu and J. Miller (2002)
"Climbing Unimodal Landscapes with Neutrality: 
A Case Study of the OneMax Problem"
(1 page) => where is full paper version => google -> seems no
Climbing-Unimodal-Landscapes-with-Neutrality: 

------------
1 eq 1 eq 1
000 -> 00 10 0
010 -> 01 00 1
101 -> 10 01 0
111 -> 11 11 1

(OK)
[1] Tina Yu and Julian Miller (2002)
Finding Needles in Haystacks is Not Hard with Neutrality
Proc. of EuroGP, LNCS 2278, pp 13-25

                       vs

M. Collins (2005)
Finding Needles in Haystacks is Harder with Neutrality.
Proceedings of the conference on Genetic and evolutionary computation
pp. 1613--1618


  
Neutrality-and-the-Evolvabilty-of-Boolean-Function-Landscapes 
Proceedings of the Fourth
European Conference on Genetic Programming. 2001.

How Many Needles in Your Haystacks


relating [1]
[3] J. Miller
"An empirical study of the efficiency of learing boolean function 
using a Cartesian _Genetic Programming approach."
Proc. of 3rd European Conference on Genetic Programming. pp. 121-132.

[5] T. Yu and J. Miller
Neutrality and the Evolvability of Boolean Function Landscapes."
Proc of the 4th European Conference on Genetic Programming.

[Other Topics on analysis of Fitness Landscapes]

=== QAP ===

(OK => merz99fitness.pdf)
P. Merz and B. Freisleben
Fitness Landscape Analysis and Memetic Algorithms for the Quadratic Assignment Problem.



=== OneMax problem ===
(OK => climbing-unimordal-landscape-with.pdf)
T. Yu and J. Miller
Climbing Unimodal Landscapes with Neutrality: A Case Study of the ONeMax Problem

=== TSP ===
(OK => fonlupt99fitness.pdf)
C. Fonlupt et al. 
Fitness Landscapes and performance of Meta-heuristics



[google with fitness-landscape needle hay]

[PDF] The Schema Theorem and Price's Theorem
ファイルタイプ: PDF/Adobe Acrobat - HTMLバージョン
The Schemata (more hay) will not be any more likely to have The high fitness
of The needle. it is The quality of The search that must be used to ... of The
fitness landscape. in RK Belew and LB Booker, editors, Proceedings of The Fourth ...
www-advancedgec.ge.uiuc.edu/papers/ Schema%20Theorem%20&%20Price's%20Theorem.pdf


(OK)
[PDF] Evolving A Sense Of Valency
ファイルタイプ: PDF/Adobe Acrobat - HTMLバージョン
effect is limited to “needle-in-the-hay-stack”problems where it is hard to search
for the. solution. Since then many researchers have dealt with ... represented by
a singularity within the fitness landscape and hence difficult to be lo- ...
www.inf.ed.ac.uk/publications/ thesis/online/IM040177.pdf - 関連ページ 



(OK)
The-Use-of-Neutral-Genotype-Phenotype-Mappings-for-Improved
R. Shipman, M. Shackleton and I. Harvey (2000): The use of neutral genotype-phenotype mappings for improved evolutionary search
BT Technology Journal, v. 18 no. 4, pp. 103-111, October 2000. ISSN 1358-3948. 
=> suspended because it took a long time


http://www.cyber.reading.ac.uk/common/publications/01408.pdf
-> also take a long time -> suspend?


-------
from reference in [1]

[2] Ebner, M., Langguth, P., Albert, J., Shackleton, M. and Shipman, R.
On neutral networks and evolvability.
Proceedings of the 2001 Congress on Evolutionary Computation,
IEEE Press (2001) 1-8.
On-neutral-networks-and-evolvability
---
http://www.ingentaconnect.com/content/mitpress/evco/2002/00000010/00000001/
art00002?token=00601b8125ee3baa2ca7630504c2a726e2d58464340592f713b672c57582
a67232d45237b6d7a317b592c74795648280
10.00usd
---
or ieee
http://intl.ieeexplore.ieee.org/xpl/abs_free.jsp?arNumber=934363

[12] Yu, T. and Miller, J.: Neutrality and the evolvability of Boolean function landscape. In:
Proceedings of the Fourth European Conference on Genetic Programming. Springer-Verlag
(2001) 204-217.