Malcolm Ryan wrote: > I have a search problem which I have expressed as a CSP in Eclipse > using lib(ic). I want to analyse how much benefit the constraint > propagation gives me over ordinary search. Is there any established > way to measure this? This is often done by counting the backtracks, e.g. using the method shown in http://eclipse-clp.org/doc/tutorial/tutorial088.html#toc82 -- JoachimReceived on Sun Jul 15 2007 - 10:19:51 CEST
This archive was generated by hypermail 2.3.0 : Wed Sep 25 2024 - 15:13:20 CEST