Results 1  10
of
1,712
Marsland and Jonathan Schaeffer, Computers, Chess, and Cognition Monty Newborn, Kasparov versus Deep Blue, Computer Chess Comes of Age
"... Prerequisites: Students should have a solid background in high school mathematics. No knowledge of any particular game is assumed. Course Work: There will be periodic homework assignments, a midterm exam, and a final exam. There will be “laboratory ” work outside of class. Grading: The relative weig ..."
Abstract
 Add to MetaCart
Prerequisites: Students should have a solid background in high school mathematics. No knowledge of any particular game is assumed. Course Work: There will be periodic homework assignments, a midterm exam, and a final exam. There will be “laboratory ” work outside of class. Grading: The relative weights of the course work will be 40 % for the homework assignments and projects, 25 % for of the midterm exam, and 35 % for the final exam. You will be expected to participate in the “laboratory ” work. Syllabus: The following is a partial and potential list of topics and readings in no particular order. 1. Games (bridge, backgammon, cosmic encounter, etc.) 2. How computers play games (bridge, checkers, chess, go, poker, backgammon)
High Performance LindaUsing a Class Library (EFFICIENT LINDA MET EEN KLASSENBIBLIOTHEEK)
"... GEBOREN TE GELEEN Promotiecommissie Promotoren: Prof.dr. Arie de BruinProf.dr. Jonathan Schaeffer ..."
Abstract
 Add to MetaCart
GEBOREN TE GELEEN Promotiecommissie Promotoren: Prof.dr. Arie de BruinProf.dr. Jonathan Schaeffer
Dealing with Imperfect Information in Poker
, 1998
"... Poker provides an excellent testbed for studying decisionmaking under conditions of uncertainty. There are many benefits to be gained from designing and experimenting with poker programs. It is a game of imperfect knowledge, where multiple competing agents must understand estimation, prediction, ri ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
modeling to improve performance. Acknowledgements The author would like to acknowledge the following: ffl A big thanks to Jonathan Schaeffer, for being an excellent supervisor. ffl Darse Billings, for all his time, ideas and insightful input. ffl Duane Szafron, for contributing to the poker research
WellBeing Over Time in Britain and the USA
 JOURNAL OF PUBLIC ECONOMICS
, 2004
"... This paper estimates microeconometric happiness equations for the United States and Great Britain. Reported levels of wellbeing have declined over the last quarter of a century in the US; life satisfaction has run approximately flat through time in Britain. These ..."
Abstract

Cited by 170 (23 self)
 Add to MetaCart
This paper estimates microeconometric happiness equations for the United States and Great Britain. Reported levels of wellbeing have declined over the last quarter of a century in the US; life satisfaction has run approximately flat through time in Britain. These
Approximating GameTheoretic Optimal Strategies for Fullscale Poker
 IN INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
, 2003
"... The computation of the first complete approximations of gametheoretic optimal strategies for fullscale poker is addressed. Several abstraction techniques are combined to represent the game of 2player Texas Hold'em, having size O(10^18), using closely related models each having size ..."
Abstract

Cited by 157 (22 self)
 Add to MetaCart
The computation of the first complete approximations of gametheoretic optimal strategies for fullscale poker is addressed. Several abstraction techniques are combined to represent the game of 2player Texas Hold'em, having size O(10^18), using closely related models each having size .
RESPONDENT CUES THAT SURVEY QUESTIONS ARE IN DANGER OF BEING MISUNDERSTOOD 1 Jonathan Bloom
"... Key words " Question comprehension, linguistic cues, pragmatic cues, misunderstanding ..."
Abstract
 Add to MetaCart
Key words " Question comprehension, linguistic cues, pragmatic cues, misunderstanding
A System for Sound Analysis/Transformation/Synthesis Based on a Deterministic Plus Stochastic Decomposition
, 1989
"... This dissertation introduces a new analysis/synthesis method. It is designed to obtain musically useful intermediate representations for sound transformations. The method’s underlying model assumes that a sound is composed of a deterministic component plus a stochastic one. The deterministic compone ..."
Abstract

Cited by 128 (8 self)
 Add to MetaCart
This dissertation introduces a new analysis/synthesis method. It is designed to obtain musically useful intermediate representations for sound transformations. The method’s underlying model assumes that a sound is composed of a deterministic component plus a stochastic one. The deterministic component is represented by a series of sinusoids that are described by amplitude and frequency functions. The stochastic component is represented by a series of magnitudespectrum envelopes that function as a timevarying filter excited by white noise. Together these representations make it possible for a synthesized sound to attain all the perceptual characteristics of the original sound. At the same time the representation is easily modified to create a wide variety of new sounds. This analysis/synthesis technique is based on the shorttime Fourier transform (STFT). From the set of spectra returned by the STFT, the relevant peaks of each spectrum are detected and used as breakpoints in a set of frequency trajectories. The deterministic signal is obtained by synthesizing a sinusoid from each trajectory. Then, in order to obtain the stochastic component, a set of spectra of the deterministic component is computed, and these spectra are subtracted from the spectra of the original sound. The resulting spectral residuals are approximated by a series of envelopes, from which the stochastic signal is generated by performing an inverseSTFT. The result is a method that is appropriate for the manipulation of sounds. The intermediate representation is very flexible and musically useful in that it offers unlimited possibilities for transformation. iii iv v To Eva and Octavi vi
Parallel Sorting by Regular Sampling
, 1992
"... A new parallel sorting algorithm suitable for MIMD multiprocessors is presented. The algorithm reduces memory and bus contention, which many parallel sorting algorithms suffer from, by using a regular sampling of the data to ensure good pivot selection. For n data elements to be sorted and p process ..."
Abstract

Cited by 121 (7 self)
 Add to MetaCart
A new parallel sorting algorithm suitable for MIMD multiprocessors is presented. The algorithm reduces memory and bus contention, which many parallel sorting algorithms suffer from, by using a regular sampling of the data to ensure good pivot selection. For n data elements to be sorted and p processors, when n p 3 the algorithm is shown to be asymptotically optimal. In theory, the algorithm is within a factor of two of achieving ideal load balancing. In practice, there is almost perfect partitioning of work. On a variety of shared and distributed memory machines, the algorithm achieves better than halflinear speedups.  1. Introduction Sorting is one of most studied problems in computer science because of its theoretical interest and practical importance. With the advent of parallel processing, parallel sorting has become an important area for algorithm research. Although considerable work has been done on the theory of parallel sorting and efficient implementations on SIMD arch...
The History Heuristic and AlphaBeta Search Enhancements in Practice
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1989
"... Many enhancements to the alphabeta algorithm have been proposed to help reduce the size of minimax trees. A recent enhancement, the history heuristic, is described that improves the order in which branches are considered at interior nodes. A comprehensive set of experiments is reported which tries ..."
Abstract

Cited by 120 (22 self)
 Add to MetaCart
Many enhancements to the alphabeta algorithm have been proposed to help reduce the size of minimax trees. A recent enhancement, the history heuristic, is described that improves the order in which branches are considered at interior nodes. A comprehensive set of experiments is reported which tries all combinations of enhancements to determine which one yields the best performance. Previous work on assessing their performance has concentrated on the benefits of individual enhancements or a few combinations. However, each enhancement should not be taken in isolation; one would like to find the combination that provides the greatest reduction in tree size. Results indicate that the history heuristic and transposition tables significantly outperform other alphabeta enhancements in application generated game trees. For trees up to depth 8, when taken together, they account for over 99% of the possible reductions in tree size, with the other enhancements yielding insignificant gains. Inde...
Results 1  10
of
1,712