1 2007-05-30 Brian Gough <bjg@network-theory.co.uk>
3 * siman.c (boltzmann): moved safe_exp into boltzmann
4 (copy_state): put all copying into one function
6 2006-03-08 Brian Gough <bjg@network-theory.co.uk>
8 * test.c (square): removed inline since it causes problems with
11 2005-11-14 Brian Gough <bjg@network-theory.co.uk>
13 * siman.c (safe_exp): added a safe_exp function to avoid underflow
14 for large uphill steps
16 2003-03-31 Brian Gough <bjg@network-theory.co.uk>
18 * siman.c (gsl_siman_solve): avoid reevaluation for best_E
19 (gsl_siman_solve): loop over param.iters_fixed_T not
21 (gsl_siman_solve): initialise energy at start
23 Sat Aug 3 20:32:38 2002 Brian Gough <bjg@network-theory.co.uk>
25 * siman.c (gsl_siman_solve): fix acceptance criterion to match
26 documentation (Peter S. Christopher)
28 Thu Jun 13 20:57:00 2002 Brian Gough <bjg@network-theory.co.uk>
30 * siman.c (gsl_siman_solve): keep track of the best result
32 2002-02-07 Mark Galassi <rosalia@galassi.org>
34 * siman.c (gsl_siman_solve): bug fix in the destructor for x and
35 new_x which was being called on &x and &new_x instead of x and
36 new_x; thanks to Karsten Howes <karsten@videotron.ca>
38 Thu Jul 12 21:50:07 2001 Brian Gough <bjg@network-theory.co.uk>
40 * gsl_siman.h: changed renamed gsl_Efunc_t to gsl_siman_Efunc_t,
41 in accordance with namespace conventions
43 2000-12-15 Mark Galassi <rosalia@galassi.org>
45 * siman.c (gsl_siman_solve): reversed a small change I had made
46 earlier and went back to taking Boltzmann-conditional steps when
47 the new energy is equal to the previous one. This allows you to
48 move around if you are stuck on a plateau.
50 * gsl_siman.h, siman.c, siman_test.c, siman_tsp.c, test.c: changed
51 the siman_solve API to allow for more general search spaces. The
52 problem was that we assumed that points in the search space were
53 data structures that were allocated in continguous memory, so they
54 could not be linked structures. I replaced the malloc(), memcpy()
55 and free() calls with copy_constructor(), copyfunc() and
56 copy_destructor() functions. The user passes these functions,
57 which means that siman_solve() now takes three more arguments of
58 type gsl_siman_copy_t, gsl_siman_copy_construct_t and
59 gsl_siman_destroy_t. If these arguments are NULL (and all three
60 of them have to be NULL together), the traditional memcpy()
63 1999-02-14 Mark Galassi <rosalia@cygnus.com>
67 Tue Nov 17 17:22:14 1998 Brian Gough <bjg@vvv.lanl.gov>
69 * added #include <config.h> to all top-level source files
71 Sun Nov 8 20:40:28 1998 Brian Gough <bjg@vvv.lanl.gov>
73 * siman_tsp.c: clean up for make strict
75 1998-11-06 <bjg@ancho.lanl.gov>
77 * test.c: added prototype for memcpy using #include <string.h>
79 * siman_test.c: added prototype for memcpy using #include <string.h>
81 Wed Oct 28 15:06:58 1998 Brian Gough <bjg@vvv.lanl.gov>
83 * siman.c: added #include <string.h> for memcpy
85 Thu Aug 20 12:22:28 1998 Brian Gough <bjg@vvv.lanl.gov>
87 * siman.c: use (char *) judiciously to avoid warnings about void
88 pointer arithmetic (see randist/shuffle.c for similar examples)
90 * siman_test.c: perform several tests, using the exact answer as
91 the comparison value, rather than checking for stationarity.
93 Sun Jun 28 14:11:04 1998 Brian Gough <bjg@vvv.lanl.gov>
95 * Converted to work with rng-style random number generators
97 * gsl_siman.h: gsl_siman_step_t type functions now take a gsl_rng
98 random number generator as their first argument
100 * siman.c (gsl_siman_solve): Now takes a gsl_rng random number
101 generator as the first argument
103 Fri Jun 19 11:17:24 1998 Brian Gough <bjg@vvv.lanl.gov>
105 * siman.c (gsl_siman_solve_many): changed the variable 'throw' to
106 'u' (for uniform-random-number) so that we can compile with c++
107 where throw is a reserved word.
109 Sat May 23 13:59:55 1998 Brian Gough <bjg@vvv.lanl.gov>
111 * siman.c: made the solving functions deterministic by removing
112 the random seed, gsl_ran_seed(time(0L)). When the function is
113 non-deterministic it is hard to debug and test (about 1 time in 20
114 the test would fail due to the randomness). We can let the user do
115 the seeding if they need that.
117 1998-02-09 Mark Galassi <rosalia@nis.lanl.gov>
119 * siman_test_driver.sh (LAST_ENERGY): fixed a typo; the tests now
120 report well when they converge.
122 1998-01-30 Mark Galassi <rosalia@cygnus.com>
124 * siman_test_driver.sh, Makefile.am (TESTS): added a test driver
125 so that now "make check" does something interesting.