default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDonald F. Beal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
[c7]Donald F. Beal:
TD (mu): A Modificaiton of TD (lambda) That Enables a Program to Learn Weights for Good Play Even if It Observes Only Bad Play. JCIS 2002: 473-476- 2001
- [j48]Ren Wu, Donald F. Beal:
Fast, Memory-efficient Retrograde Algorithms. J. Int. Comput. Games Assoc. 24(3): 147-159 (2001) - [j47]Ren Wu, Donald F. Beal:
Solving Chinese chess endgames by database construction. Inf. Sci. 135(3-4): 207-228 (2001) - [j46]Donald F. Beal, Martin C. Smith:
Temporal difference learning applied to game playing and the results of application to Shogi. Theor. Comput. Sci. 252(1-2): 105-119 (2001) - [c6]Ren Wu, Donald F. Beal:
Parallel Retrograde Analysis on Different Architecture. HPDC 2001: 356-362 - 2000
- [j45]Donald F. Beal:
The iCCA Treasurer's Report for 1999. J. Int. Comput. Games Assoc. 23(1): 62-63 (2000) - [j44]Donald F. Beal, Martin C. Smith:
Temporal Difference Learning for Heuristic Search and Game Playing. Inf. Sci. 122(1): 3-21 (2000)
1990 – 1999
- 1999
- [j43]Donald F. Beal:
The ICCA Treasurer's Report for 1998. J. Int. Comput. Games Assoc. 22(1): 45-46 (1999) - [j42]Donald F. Beal:
The 9th World Computer-Chess Championship: The Search-Engine Features of the Programs. J. Int. Comput. Games Assoc. 22(3): 160-163 (1999) - [j41]Donald F. Beal:
Minutes of the ICCA Triennial Meeting. J. Int. Comput. Games Assoc. 22(3): 171 (1999) - [j40]Donald F. Beal, Martin C. Smith:
Learning Piece-square Values using Temporal Differences. J. Int. Comput. Games Assoc. 22(4): 223-235 (1999) - [c5]Donald F. Beal, Martin C. Smith:
Temporal Coherence and Prediction Decay in TD Learning. IJCAI 1999: 564-569 - 1998
- [j39]Donald F. Beal:
Drifting Down Slightly - ICCA Treasurer's Report for 1997. J. Int. Comput. Games Assoc. 21(1): 68-69 (1998) - [c4]Donald F. Beal, Martin C. Smith:
First Results from Using Temporal Difference Learning in Shogi. Computers and Games 1998: 113-125 - 1997
- [j38]Donald F. Beal:
Riding High: The ICCA Treasurer's Report for 1996. J. Int. Comput. Games Assoc. 20(1): 62-63 (1997) - [j37]Donald F. Beal, Martin C. Smith:
Learning Piece Values Using Temporal Differences. J. Int. Comput. Games Assoc. 20(3): 147-151 (1997) - 1996
- [j36]Donald F. Beal:
Feast and Famine: ICCA Treasurers Report for 1995. J. Int. Comput. Games Assoc. 19(2): 133-134 (1996) - [j35]Donald F. Beal, Martin C. Smith:
Multiple Probes of Transposition Tables. J. Int. Comput. Games Assoc. 19(4): 227-233 (1996) - 1995
- [j34]Donald F. Beal:
ICCA: The Treasurer's Report. J. Int. Comput. Games Assoc. 18(1): 61-62 (1995) - [j33]Donald F. Beal:
An Integrated-Bounds-and-Values (IBV) Numeric Scale for Minimax Searches. J. Int. Comput. Games Assoc. 18(2): 77-81 (1995) - [j32]Donald F. Beal:
Round-by-Round. J. Int. Comput. Games Assoc. 18(2): 94-96 (1995) - [j31]Donald F. Beal:
Minutes of the ICCA Triennial Meeting. J. Int. Comput. Games Assoc. 18(2): 112-113 (1995) - [j30]Donald F. Beal:
The Treasurer's Report for 1994 (continued). J. Int. Comput. Games Assoc. 18(2): 113 (1995) - [j29]Donald F. Beal, Martin C. Smith:
Quantification of Search-Extension Benefits. J. Int. Comput. Games Assoc. 18(4): 205-218 (1995) - [j28]Donald F. Beal, Costas Lambrinoudakis:
Design of a Processor Element for a High Performance Massively Parallel SIMD System. Int. J. High Speed Comput. 7(3): 365-390 (1995) - 1994
- [j27]Donald F. Beal, Martin C. Smith:
Random Evaluations in Chess. J. Int. Comput. Games Assoc. 17(1): 3-9 (1994) - [j26]Donald F. Beal:
Michael Clarke: An Obituary. J. Int. Comput. Games Assoc. 17(1): 38 (1994) - [j25]Don Beal:
The QMW's Uniform-Platform Computer-Chess Tournament. J. Int. Comput. Games Assoc. 17(1): 44-45 (1994) - [j24]Don Beal:
ICCA: The Treasurer's Report. J. Int. Comput. Games Assoc. 17(1): 46-47 (1994) - [j23]Donald F. Beal:
Report on the QMW Uniform-Platform World Championship 1994. J. Int. Comput. Games Assoc. 17(3): 167-173 (1994) - [j22]Don Beal:
An Answer. J. Int. Comput. Games Assoc. 17(3): 178 (1994) - [j21]Don Beal:
ICCA Programmers' Contacts. J. Int. Comput. Games Assoc. 17(4): 219 (1994) - 1993
- [j20]Don Beal:
The 1993 Uniform-Platform Computer-Chess Tournament. J. Int. Comput. Games Assoc. 16(1): 64 (1993) - [j19]Don Beal:
ICCA Incoming Treasurer's Report. J. Int. Comput. Games Assoc. 16(1): 66-67 (1993) - [j18]Don Beal:
Report on the QMW 1993 Uniform-Platform Computer-Chess Championship. J. Int. Comput. Games Assoc. 16(3): 166-170 (1993) - 1992
- [j17]Don Beal:
Heuristic Programming in Artificial Intelligence 3. J. Int. Comput. Games Assoc. 15(2): 79-80 (1992) - [j16]Don Beal:
The QMW "Unifonn Platform" / "Software Intelligence" Computer-Chess Tournament. J. Int. Comput. Games Assoc. 15(2): 99 (1992) - [j15]Don Beal:
The 1992 QMW Uniform-Platform Autoplay Computer-Chess Tournament. J. Int. Comput. Games Assoc. 15(3): 162-167 (1992) - [j14]Don Beal:
The 1993 Uniform-Platform Computer-Chess Tournament. J. Int. Comput. Games Assoc. 15(3): 173-174 (1992) - [j13]Don Beal:
Minutes of the ICCA Triennial Meeting. J. Int. Comput. Games Assoc. 15(4): 230-231 (1992) - 1991
- [j12]Don Beal:
Report on the 11th World Microcomputer Chess Championship. J. Int. Comput. Games Assoc. 14(2): 86-91 (1991) - [j11]Don Beal:
Rules, Titles, and Just What Is a PC Anyway? J. Int. Comput. Games Assoc. 14(2): 94-96 (1991) - [j10]Don Beal:
Report on the 22nd ACM International Computer Chess Championship. J. Int. Comput. Games Assoc. 14(4): 214-217 (1991) - [c3]Donald F. Beal, Costas Lambrinoudakis
:
GPFP: an array processing element for the next generation of massively parallel supercomputer architectures. SC 1991: 348-357 - [c2]Donald F. Beal, Costas Lambrinoudakis:
GPFP: A SIMD PE for Higher VLSI Densities. VLSI 1991: 347-356 - 1990
- [j9]Hans J. Berliner, Donald F. Beal:
Introduction. Artif. Intell. 43(1): 1-5 (1990) - [j8]Donald F. Beal:
A Generalised Quiescence Search Algorithm. Artif. Intell. 43(1): 85-98 (1990) - [j7]David N. L. Levy, Donald F. Beal:
Heuristic Programming in Artificial Intelligence. J. Int. Comput. Games Assoc. 13(1): 28 (1990)
1980 – 1989
- 1988
- [j6]Donald F. Beal:
All The Right Moves - A VLSI Architecture for Chess Carl Ebeling, 1987. The MIT Press, Massachusetts. pp 145. Knowl. Eng. Rev. 3(1): 94-95 (1988) - 1986
- [j5]Donald F. Beal:
Selective Search without Tears. J. Int. Comput. Games Assoc. 9(2): 76-80 (1986) - [j4]Donald F. Beal:
Review. J. Int. Comput. Games Assoc. 9(2): 88 (1986) - [j3]Donald F. Beal:
Review. J. Int. Comput. Games Assoc. 9(2): 88-89 (1986) - 1984
- [j2]Donald F. Beal:
Mixing Heuristic and Perfect Evaluations: Nested Minimax. J. Int. Comput. Games Assoc. 7(1): 10-15 (1984) - [j1]Donald F. Beal:
Mating Sequences in the Quiescence Search. J. Int. Comput. Games Assoc. 7(3): 133-137 (1984) - 1983
- [c1]Donald F. Beal:
Recent progress in understanding minimax search. ACM Annual Conference 1983: 164-169
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
