By Topic

Unobtrusive workstation farming without inconveniencing owners: learning Backgammon with a genetic algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Darwen, P.J. ; Dept. of Comput. Sci. & Electr. Eng., Queensland Univ., Brisbane, Qld., Australia

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

Published in:

Cluster Computing, 1999. Proceedings. 1st IEEE Computer Society International Workshop on

Date of Conference:

1999