[gecode-users] Intelligent backtracking methods

[Christian Schulte]

Not that much dedicated to Gecode in particular. But the interface is in
large aspects very close to the Mozart interface for search which is well
documented:
	http://web.it.kth.se/~cschulte/paper.html?id=Schulte:LNAI:2002

The only difference is how recomputation in detail works, but that becomes
rather obvious when checking how recomputation is implemented for the search
engines in Gecode (check the file reco-stack).

Cheers
Christian

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


-----Original Message-----
From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of Debdeep Banerjee
Sent: Tuesday, June 10, 2008 9:34 AM
To: cschulte at kth.se; users at gecode.org
Subject: Re: [gecode-users] Intelligent backtracking methods

Hi,

> However, you can implement your own search methods as Gecode features an
> enormously powerful interface for programming search. In particular, as
> search is based on recomputation and copying, any move in the tree is
easy.
>   
Is there any paper or documentation for that recomputation stuff ?

with regards
Debdeep

-- 
Debdeep Banerjee
PhD Candidate
CSL/RSISE/NICTA
Australian National University
Email: debdeep.banerjee at rsise.anu.edu.au
Web:http://rsise.anu.edu.au/~banerjed



_______________________________________________
Gecode users mailing list
users at gecode.org
https://www.gecode.org/mailman/listinfo/gecode-users