RE: Incomplete tree search algorithms: references?

From: Helmut Simonis <helmut.simonis_at_parc-technologies.com>
Date: Mon 10 Nov 2003 04:06:15 PM GMT
Message-ID: <3E899FAFBF56D611B6A500508B9A9DA20444B0@LON-SRV2> 
Hi,

a reference for credit-based search is

N. Beldiceanu, E. Bourreau, P. Chan, D. Rivreau
Partial Search Strategy in CHIP
2nd International Conference on Metaheuristics - MIC 97
Sophia Antipolis, France July 21-24, 1997


Regards

Helmut Simonis

-----Original Message-----
From: Hana Rudova [mailto:hanka@fi.muni.cz]
Sent: 10 November 2003 12:46
To: eclipse-users@icparc.ic.ac.uk
Cc: Roman Bartak
Subject: [eclipse-users] Incomplete tree search algorithms: references?


Hello,

ECLiPSe tutorial refers to various incomplete tree search algorithms.
However,
there are no references. Do you know any references about

Credit Search, Bounded Backtrack Search, and Depth Bounded Search?

I used them in my experiments and would need some citations but I really
don't
know anything about original articles. So, any references would be very
helful for
me.

Thanks a lot,

   Hana

   ----
   Hana Rudova, Ph.D.
   Faculty of Informatics, Masaryk University
   Botanicka 68a, Brno, Czech Republic
   hanka@fi.muni.cz
   http://www.fi.muni.cz/~hanka
   Tel: +420-603 173 151
   Fax: +420-541 212 568
Received on Mon Nov 10 18:37:08 2003

This archive was generated by hypermail 2.1.8 : Wed 16 Nov 2005 06:07:26 PM GMT GMT