/
-Original Message-
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf
Of Tias Guns
Sent: Tuesday, June 10, 2008 2:28 PM
To: [EMAIL PROTECTED]
Subject: Re: [gecode-users] Intelligent backtracking methods
Just out of interesest, I wonder how this relates to the constraint store ?
More
TED] On
> Behalf
> Of Debdeep Banerjee
> Sent: Tuesday, June 10, 2008 9:34 AM
> To: [EMAIL PROTECTED]; [EMAIL PROTECTED]
> Subject: Re: [gecode-users] Intelligent backtracking methods
>
> Hi,
>
>> However, you can implement your own search methods as Gecode feature
Banerjee
Sent: Tuesday, June 10, 2008 9:34 AM
To: [EMAIL PROTECTED]; [EMAIL PROTECTED]
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 part
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 stu
]
Subject: [gecode-users] Intelligent backtracking methods
Hi,
I want to know if the DFS search implements any intelligent backtracking
methods (for example backjumping, conflict directed backjumping etc).
Thanking you.
With regards
Debdeep
--
Debdeep Banerjee
PhD Candidate
CSL/RSISE/NICTA
Australian
Hi,
I want to know if the DFS search implements any intelligent backtracking
methods (for example backjumping, conflict directed backjumping etc).
Thanking you.
With regards
Debdeep
--
Debdeep Banerjee
PhD Candidate
CSL/RSISE/NICTA
Australian National University
Email: [EMAIL PROTECTED]
Web:ht
