1245 search results - page 13 / 249 » Playing with Conway's problem |
JCDL
2005
ACM
14 years 1 months ago
2005
ACM
The Exploratorium, an interactive hand-on science museum, is developing an online collection of science learning and teaching resources to better serve educators’ needs for peda...
CLUSTER
2001
IEEE
13 years 11 months ago
2001
IEEE
At UCLA's Plasma Physics Group, we have been successful in building and using a numerically-intensive parallel computing cluster using Power Macintosh hardware and the Macint...
JMLR
2010
13 years 2 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
BIBE
2008
IEEE
14 years 2 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...