Unobtrusive Workstation Farming Without Inconveniencing Owners: Learning Backgammon with a Genetic Algorithm

I
IWCC
1999
1st IEEE Computer Society International Workshop on Cluster Computing
Abstract - Unobtrusive Workstation Farming Without Inconveniencing Owners: Learning Backgammon with a Genetic Algorithm

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Paul Darwen

1st IEEE Computer Society International Workshop on Cluster Computing

Melbourne, Australia

December 02-December 03

ISBN: 0-7695-0343-8

	ASCII Text	x
	Paul Darwen, "Unobtrusive Workstation Farming Without Inconveniencing Owners: Learning Backgammon with a Genetic Algorithm," Cluster Computing, International Workshop on, pp. 303, 1st IEEE Computer Society International Workshop on Cluster Computing, 1999.

	BibTex	x
	@article{ 10.1109/IWCC.1999.810900, author = {Paul Darwen}, title = {Unobtrusive Workstation Farming Without Inconveniencing Owners: Learning Backgammon with a Genetic Algorithm}, journal ={Cluster Computing, International Workshop on}, volume = {0}, year = {1999}, issn = {1530-1885}, pages = {303}, doi = {http://doi.ieeecomputersociety.org/10.1109/IWCC.1999.810900}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Cluster Computing, International Workshop on TI - Unobtrusive Workstation Farming Without Inconveniencing Owners: Learning Backgammon with a Genetic Algorithm SN - 1530-1885 SP EP A1 - Paul Darwen, PY - 1999 KW - genetic algorithms KW - co-evolutionary learning KW - neural networks KW - unobtrusive workstation farming VL - 0 JA - Cluster Computing, International Workshop on ER -

Paul Darwen, University of Queensland

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IWCC.1999.810900

Most efforts at low-cost parallel computing assume a monopoly on the hardware being used. That all-or-nothing attitude ignores many machines dedicated to other activities, but which sit idle for 16 hours a day. However, naive attempts to utilize idle machines can interfere with their primary purpose. This paper describes the successful effort to unobtrusively farm idle machines, for an artificial intelligence system using a genetic algorithm to learn the game Backgammon. It maintains owners' full access to their machines, without causing any detectable interference.

Index Terms:

genetic algorithms, co-evolutionary learning, neural networks, unobtrusive workstation farming

Citation:

Paul Darwen, "Unobtrusive Workstation Farming Without Inconveniencing Owners: Learning Backgammon with a Genetic Algorithm," iwcc, pp.303, 1st IEEE Computer Society International Workshop on Cluster Computing, 1999

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.