[gecode-users] papers to cite

[Mauricio Toro]

Hello,
I am writting a tech report about my implementation of CCP
and I want argue that using Gecode is a better choice
than using Mozart-Oz for doing Concurrent Constraint Programming.

I know you guys do not like that idea of doing CCP with Gecode,
but I was wondering if you can give reference some papers about:

- the performance tests where Gecode is compared with other
constraint solvers.
- why is the idea of using fixpoints and spaces more efficient
than the threads and nested spaces used in mozart?
- why are propagators in gecode so efficient?
- why we do not use combinators in gecode?

and related information...

Thanks

Mauricio


-- 
Mauricio Toro Bermudez
Estudiante de Ingeniería de Sistemas
Pontificia Universidad Javeriana, Colombia

Stagiare à l'Ircam
1, place Igor-Stravinsky 75004 Paris,
France de 2008 à 2009
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.ps.uni-sb.de/pipermail/users/attachments/20080616/4fdb9b8f/attachment.htm>