How do you mean effective?
While I am not sure they mention A* search, you might like to look at
the paper
Modular Lazy Search for Constraint Satisfaction Problems by Nordin
Tolmach.
http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4704
RS
On 22/10/11 13:28, Anton Kholomiov
On 20/06/11 15:45, Richard Senington wrote:
Hi all,
I have recently become interested in Dataflow programming and how it
related to functional languages.
I am wondering if the community has any advice on reading matter or
other directions to look at.
So far I have been looking through
On 20/06/11 16:37, David Barbour wrote:
On Mon, Jun 20, 2011 at 7:45 AM, Richard Senington
sc06...@leeds.ac.uk mailto:sc06...@leeds.ac.uk wrote:
I have recently become interested in Dataflow programming and how
it related to functional languages.
I am wondering if the community has
Hi all,
I have recently become interested in Dataflow programming and how it
related to functional languages.
I am wondering if the community has any advice on reading matter or
other directions to look at.
So far I have been looking through the FRP libraries, using Haskell
functions with
On 06/04/11 20:32, Brandon Moore wrote:
From: Yves Parèslimestr...@gmail.com
Sent: Wed, April 6, 2011 1:57:51 PM
Hello Café,
I'm trying to get some modular data types.
The idea that came to me is that I could stack them, for instance :
data Character a = Character { life :: Int,
Hello all,
I have just uploaded a very early (0.0.1) version of a library I am
working on to hackage. The library is for representing some well known
combinatorial problems, and provide loading routines for standard
repositories of these problems.
At the moment is only support SAT-3 and
Hi all,
I am working on ways to implement local search meta-heuristics in Haskell.
I need various test problems to experiment on, and this has resulted in me
building various file parsers and data structures for these.
Currently I have versions for SAT, TSP and a couple of more private file
On 11/11/10 21:34, Luke Palmer wrote:
On Thu, Nov 11, 2010 at 3:13 AM, Richard Seningtonsc06...@leeds.ac.uk wrote:
I got hold of, and looked through the paper suggested in the root of this
thread “Pseudo random trees in Monte-Carlo, and based upon this
I have thrown together a version of
On 12/11/10 20:56, Bryan O'Sullivan wrote:
On Fri, Nov 12, 2010 at 12:34 PM, Luke Palmer lrpal...@gmail.com
mailto:lrpal...@gmail.com wrote:
Yeah I think a package of randomness tests could be really useful.
Cool :-)
There are already well-established suites of very thorough PRNG
I got hold of, and looked through the paper suggested in the root of
this thread Pseudo random trees in Monte-Carlo
http://portal.acm.org/citation.cfm?id=1746034, and based upon this
I have thrown together a version of the binary tree based random number
generator suggested.
I would like to
I might have a use for this, so I could give it a go.
I'll have a look through this post in detail tomorrow morning.
RS
On 04/11/10 17:38, Simon Peyton-Jones wrote:
Hi Cafe
A while back there was a thread
http://www.mail-archive.com/haskell-cafe@haskell.org/msg79633.html
about a good
11 matches
Mail list logo
