🚀 go-pugleaf

On Jul 21, 6:51 am, roberto03 <robert...@gmail.com> wrote:
> On Jul 21, 4:31 am, Ted Dunning <ted.dunn...@gmail.com> wrote:
> > Let me first warn that I really know little about this specific
> > problem.
>
> > But it does smell quite a bit like many coding problems where you are
> > trying to find a bit string that matches some criterion given partial
> > information.  There are lots of interesting results to do with
> > probabilistic optimization of bit strings in the area of coding, but
> > some of these results depend on careful construction of the code.
> > There are also related sorts of issues in Ising systems.
>
> this could be a quite good way to solve the problem
> may you point me to some good reference about it ?
> thanks in advance
>

For the part about decoding algorithms, start with Mackay's book:
http://www.inference.phy.cam.ac.uk/mackay/itprnn/book.html


For the part about using an additional component to the function you
are optimizing that captures how far from ideal your string is, I just
made that up.  The technique of replacing a hard constraint with a
soft one is a very old one in the optimization literature, though, so
I wouldn't claim to have any better insight about that than would
thousands of others.

[ comp.ai is moderated ... your article may take a while to appear. ]