Search and planning under incomplete information : a study using Bridge card play

This thesis investigates problem-solving in domains featuring incomplete information and multiple agents with opposing goals. In particular, we describe Finesse --- a system that forms plans for the problem of declarer play in the game of Bridge. We begin by examining the problem of search. We formalise a best defence model of incomplete information games in which equilibrium point strategies can be identified, and identify two specific problems that can affect algorithms in such domains. In Bridge, we show that the best defence model corresponds to the typical model analysed in expert texts, and examine search algorithms which overcome the problems we have identified. Next, we look at how planning algorithms can be made to cope with the difficulties of such domains. This calls for the development of new techniques for representing uncertainty and actions with disjunctive effects, for coping with an opposition, and for reasoning about compound actions. We tackle these problems with a..

The deep space network

Deep Space Network progress in flight support, tracking and data acquisition research and technology, network engineering, hardware and software implementation, and operations are reported

Covering Radius 1985-1994

We survey important developments in the theory of covering radius during the period 1985-1994. We present lower bounds, constructions and upper bounds, the linear and nonlinear cases, density and asymptotic results, normality, specific classes of codes, covering radius and dual distance, tables, and open problems

Cumulative index to NASA Tech Briefs, 1986-1990, volumes 10-14

Tech Briefs are short announcements of new technology derived from the R&D activities of the National Aeronautics and Space Administration. These briefs emphasize information considered likely to be transferrable across industrial, regional, or disciplinary lines and are issued to encourage commercial application. This cumulative index of Tech Briefs contains abstracts and four indexes (subject, personal author, originating center, and Tech Brief number) and covers the period 1986 to 1990. The abstract section is organized by the following subject categories: electronic components and circuits, electronic systems, physical sciences, materials, computer programs, life sciences, mechanics, machinery, fabrication technology, and mathematics and information sciences

Ames Research Center publications: A continuing bibliography, 1978

This bibliography lists formal NASA publications, journal articles, books, chapters of books, patents and contractor reports issued by Ames Research Center which were indexed by Scientific and Technical Aerospace Abstracts, Limited Scientific and Technical Aerospace Abstracts, and International Aerospace Abstracts in 1978. Citations are arranged by directorate, type of publication and NASA accession numbers. Subject, personal author, corporate source, contract number, and report/accession number indexes are provided

The Telecommunications and Data Acquisition Report

Archival reports on developments in programs managed by JPL's Office of Telecommunications and Data Acquisition (TDA) are presented. Activities of the Deep Space Network (DSN) and its associated Ground Communications Facility (GCF) related to DSN advanced systems, systems implementation, and DSN operations are addressed. In addition, recent developments in the NASA SETI (Search for Extraterrestrial Intelligence) sky survey are summarized

Technology 2004, Vol. 2

Proceedings from symposia of the Technology 2004 Conference, November 8-10, 1994, Washington, DC. Volume 2 features papers on computers and software, virtual reality simulation, environmental technology, video and imaging, medical technology and life sciences, robotics and artificial intelligence, and electronics

The correct solution to Berlekamp's switching game

AbstractWe look at Berlekamp's switching game of n×n grids for n⩾10. We show that the previous result for R10 was incorrect, and that in fact R10=35. We also show that R11=43 and R12=54, and give new lower bounds for R13 through R20