On Oct 22, 2007, at 3:00 PM, Jeremy Shaw wrote:
Well, the most important part has not been done -- as you noted there
is no library on hackage.
It would be excellent if you could:
1. talk the upstream author's into releasing the source under BSD
2. cabalize / haddock it and upload to hackag
At Mon, 22 Oct 2007 14:45:51 -0400,
David F. Place wrote:
>
>
> On Oct 22, 2007, at 2:26 PM, Jeremy Shaw wrote:
>
> > Hello,
> >
> > If you have not seen this paper, you may enjoy it:
> >
> > Modular Lazy Search for Constraint Satisfaction Problems (2001)
> > Thomas Nordin, Andrew Tolmach
> >
>
On Oct 22, 2007, at 2:26 PM, Jeremy Shaw wrote:
Hello,
If you have not seen this paper, you may enjoy it:
Modular Lazy Search for Constraint Satisfaction Problems (2001)
Thomas Nordin, Andrew Tolmach
http://citeseer.ist.psu.edu/608419.html
Yes, perfect. It seems that the work is already
Hello,
If you have not seen this paper, you may enjoy it:
Modular Lazy Search for Constraint Satisfaction Problems (2001)
Thomas Nordin, Andrew Tolmach
http://citeseer.ist.psu.edu/608419.html
j.
At Mon, 22 Oct 2007 10:19:52 -0400,
David F. Place wrote:
>
> Dear [Reader]:
>
> Recently, I nee
On Oct 22, 2007, at 10:56 AM, Henning Thielemann wrote:
On Mon, 22 Oct 2007, David F. Place wrote:
BTW, the problem I am working on is an automated approach to lifting
pieces of Renaissance polyphony from 3-limit to 5-limit Just
Intonation.
I don't understand this sentence, but it sounds
On Mon, 22 Oct 2007, David F. Place wrote:
> BTW, the problem I am working on is an automated approach to lifting
> pieces of Renaissance polyphony from 3-limit to 5-limit Just Intonation.
I don't understand this sentence, but it sounds like Music processing,
which I'm interested in. (See darcs.
Dear [Reader]:
Recently, I needed to solve a constraint satisfaction problem. So I
coded a solution using backtracking and tabu lists. I was pleased to
see how easy it is in Haskell. As an exercise, I created a module
and a class interface for the search algorithm. That was also a
ple
