Fix Headers + TODO

GeomScale · Jul 18, 2024 · e5c011a · e5c011a
1 parent dd3cc03
commit e5c011a
Show file tree

Hide file tree

Showing 3 changed files with 4 additions and 12 deletions.
diff --git a/examples/crhmc_cooling_gaussians/CMakeLists.txt b/examples/crhmc_cooling_gaussians/CMakeLists.txt
@@ -2,7 +2,7 @@
 
 # Copyright (c) 2012-2024 Vissarion Fisikopoulos
 # Copyright (c) 2018-2024 Apostolos Chalkis
-# Copyright (c) 2024-2024 Vladimir Necula
+# Copyright (c) 2024 Vladimir Necula
 
 # Contributed and/or modified by Vladimir Necula, as part of Google Summer of
 # Code 2024 program.

diff --git a/examples/crhmc_cooling_gaussians/volume_example.cpp b/examples/crhmc_cooling_gaussians/volume_example.cpp
@@ -2,7 +2,7 @@
 
 // Copyright (c) 2012-2024 Vissarion Fisikopoulos
 // Copyright (c) 2018-2024 Apostolos Chalkis
-// Copyright (c) 2024-2024 Vladimir Necula
+// Copyright (c) 2024 Vladimir Necula
 
 // Contributed and/or modified by Vladimir Necula, as part of Google Summer of
 // Code 2024 program.

diff --git a/include/volume/volume_cooling_gaussians_crhmc.hpp b/include/volume/volume_cooling_gaussians_crhmc.hpp
@@ -2,7 +2,7 @@
 
 // Copyright (c) 2012-2024 Vissarion Fisikopoulos
 // Copyright (c) 2018-2024 Apostolos Chalkis
-// Copyright (c) 2024-2024 Vladimir Necula
+// Copyright (c) 2024 Vladimir Necula
 
 // Contributed and/or modified by Vladimir Necula, as part of Google Summer of
 // Code 2024 program.
@@ -21,15 +21,6 @@
 #include "volume/volume_cooling_gaussians.hpp"
 #include "preprocess/crhmc/crhmc_problem.h"
 
-////////////////////////////// Algorithms
-
-// Gaussian Anealling
-
-// Implementation is based on algorithm from paper "A practical volume algorithm",
-// Springer-Verlag Berlin Heidelberg and The Mathematical Programming Society 2015
-// Ben Cousins, Santosh Vempala
-
-// Compute a_{i+1} when a_i is given
 template
 <
     typename CRHMCWalkType,
@@ -161,6 +152,7 @@ void compute_annealing_schedule(Polytope& P,
         NT curr_its = 0;
         auto steps = totalSteps;
 
+        //TODO: potential problem creation and preprocessing optimization
 
         //create the crhmc problem for this variance
         int dimension = P.dimension();