[gecode-users] papers to cite

[Christian Schulte]

Sorry, but actually I did not express that I do not like what you do. 

 

I just said that CCP is about communication and synchronization which
presupposes the exchange of meaningful messages. This is impossible in
Gecode and hence Oz is by definition the better choice for CCP as Gecode is
no choice. As said, no opinion, just a fact.

 

Please, check the resources we provide so that you can do your own scholar
work.

 

Christian

 

--

Christian Schulte, www.ict.kth.se/~cschulte/

 

From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of Mauricio Toro
Sent: Monday, June 16, 2008 6:11 PM
To: gecode list
Subject: [gecode-users] papers to cite

 

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/20080617/657dd017/attachment.htm>