Author: Omid David Tabibi
Date: 17:33:26 06/10/03
Go up one level in this thread
On June 10, 2003 at 20:26:03, Omid David Tabibi wrote: >On June 10, 2003 at 20:22:54, Andreas Herrmann wrote: > >>On June 10, 2003 at 20:04:35, Robert Hyatt wrote: >> >>>On June 10, 2003 at 19:51:34, Andreas Herrmann wrote: >>> >>>>Hi, >>>> >>>>at first i'm seraching for the following paper: >>>>Korf, R.E. (1985). Iterative deepening: An optimal admissible tree search. >>>>Artificial Intelligence, Vol. 27, No. 1, pp. 97-109. >>>> >>>>Is that somewhere available in the internet? Or can someone send it me by email? >>>>I'm also looking for similar papers. >>>> >>>> >>>>To the theme "Singular Extensions" i have found a paper named "VARIABLE SEARCH >>>>DEPTH" by T.A.Marsland. Are there better or similar papers available? >>>> >>>> >>>>Andreas >>> >>> >>>Hsu and Campbell wrote more than one. One pretty good one was published >>>in the JICCA... Anantharaman, Thomas, Murray S. Campbell, and Feng-hsiung Hsu, ``Singular Extensions: Adding selectivity to brute-force searching,'' Artificial Intelligence, vol 43 (1990), 99-109. Anantharaman, T.S., Campbell, M.S. and Hsu, F. (1988). Singular ExtenÂsions: Adding Selectivity to Brute-Force Searching. ICCA Journal, Vol. 11, No. 4, pp. 135-143. >> >>Hi Bob, >> >>thanks for your answer. But what is JICCA, > >ICCA, International Computer Chess Association (recently renamed to ICGA, G for >Games) http://www.icga.org > >The 'J' Bob added stands for Journal :) > >>with Google i have found a Delphi >>forum with this name, but i think you mean something different. Have you an >>internet adress where i can find this papers. > >The best place to search for computer science papers is NEC's CiteSeer: >http://citeseer.nj.nec.com/cs > > >> >>Andreas
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.