- Timestamp:
- 04/29/19 15:04:12 (6 years ago)
- Location:
- trunk/HeuristicLab.Problems.GeneticProgramming/3.3/Boolean
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/HeuristicLab.Problems.GeneticProgramming/3.3/Boolean/EvenParityProblem.cs
r16565 r16873 23 23 using System.Collections.Generic; 24 24 using System.Linq; 25 using HEAL.Attic; 25 26 using HeuristicLab.Common; 26 27 using HeuristicLab.Core; … … 28 29 using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding; 29 30 using HeuristicLab.Parameters; 30 using HEAL.Attic;31 31 32 32 -
trunk/HeuristicLab.Problems.GeneticProgramming/3.3/Boolean/MultiplexerProblem.cs
r16565 r16873 24 24 using System.Diagnostics.Contracts; 25 25 using System.Linq; 26 using HEAL.Attic; 26 27 using HeuristicLab.Common; 27 28 using HeuristicLab.Core; … … 29 30 using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding; 30 31 using HeuristicLab.Parameters; 31 using HEAL.Attic;32 32 33 33 … … 88 88 var g = new SimpleSymbolicExpressionGrammar(); // will be replaced in update grammar 89 89 Encoding = new SymbolicExpressionTreeEncoding(g, 100, 17); 90 Encoding.GrammarParameter.ReadOnly = true; 90 91 91 92 UpdateGrammar(); … … 110 111 g.AddTerminalSymbol(string.Format("d{0}", i)); 111 112 113 Encoding.GrammarParameter.ReadOnly = false; 112 114 Encoding.Grammar = g; 115 Encoding.GrammarParameter.ReadOnly = true; 113 116 114 117 BestKnownQuality = Math.Pow(2, NumberOfBits); // this is a benchmark problem (the best achievable quality is known for a given number of bits)
Note: See TracChangeset
for help on using the changeset viewer.