The background of the presentation is a perspective on the development of wireless technology from 2000 to 2010. The foreground of the presentation is a contrasted understanding of intelligence in "natural" wireless (human communication) versus "artificial" wireless (communication between devices). Invited talk, presented at The Twelfth Annual Conference on Innovative Applications of Artificial Intelligence (IAAI-2000), Austin, TX, August, 2000.

First appeared asRussell, S. J., Subramanian, D., and Parr, R. , "Provably bounded optimal agents", IJCAI-93, pp. 338-€“345. Journal of Artificial Intelligence Research, 1 (1995), pp.1-36.

This book (originally published in 1994 by Ellis Horwood) is now out of print. The copyright now resides with the editors who have decided to make the material freely available on the web.This book is based on the EC (ESPRIT) project StatLog which compare and evaluated a range of classification techniques, with an assessment of their merits, disadvantages and range of application. This integrated volume provides a concise introduction to each method, and reviews comparative trials in large-scale commercial and industrial problems. It makes accessible to a wide range of workers the complex issue of classification as approached through machine learning, statistics and neural networks, encouraging a cross-fertilization between these discplines.

Phil. Trans. R. Soc. Lond. A. 1994 349 1689. Intelligence is a complex, natural phenomenon exhibited by humans and many other living things, without sharply defined boundaries between intelligent and unintelligent behaviour. Artificial inteliigence focuses on the phenomenon of intelligent behaviour, in humans or machines. Experimentation with computer programs allows us to manipulate their design and intervene in the environmental conditions in ways that are not possible with humans. Thus, experimentation can help us to understand what principles govern intelligent action and what mechanisms are sufficient for computers to replicate intelligent behaviours.

The purpose of the Institute of Mathematical Statistics (IMS) is to foster the development and dissemination of the theory and applications of statistics and probability. The Institute was formed at a meeting of interested persons on September 12, 1935, in Ann Arbor, Michigan, as a consequence of the feeling that the theory of statistics would be advanced by the formation of an organization of those persons especially interested in the mathematical aspects of the subject. The Annals of Statistics and The Annals of Probability (which supersede The Annals of Mathematical Statistics), Statistical Science, and The Annals of Applied Probability are the scientific journals of the Institute. These and The IMS Bulletin comprise the official journals of the Institute. The Institute has individual membership and organizational membership.

Neural networks, despite their empirically proven abilities, have been little used for the refinement of existing knowledge because this task requires a three-step process. First, knowledge must be inserted into a neural network. Second, the network must be refined. Third, the refined knowledge must be extracted from the network. We have previously described a method for the first step of this process.

Touretzky (1984) proposed a formalism for nonmonotonic multiple inheritance reasoning which is sound in the presence of ambiguities and redundant links. We show that Touretzky's inheritance notion is NPhard, and thus, provided P#NP, computationally intractable. This result holds even when one only considers unambiguous, totally acyclic inheritance networks. A direct consequence of this result is that the conditioning strategy proposed by Touretzky to allow for fast parallel inference is also intractable. Therefore, it follows that nonmonotonic multiple inheritance hierarchies, although compact representations, may not allow for efficient retrieval of information as has been suggested in attempts to use such hierarchies, e.g., in NETL (Fahlman 1979). We also analyze the influence of various design choices made by Touretzky. We show that all versions of downward (coupled) inheritance, i.e., on-path or off-path preemption and skeptical or credulous reasoning, are intractable. However, tractability can be achieved when using upward (decoupled) inheritance.

Prentice-Hall.

The field of AI is directed at the fundamental problem of how the mind works; its approach, among other things, is to try to simulate its working -- in bits and pieces. History shows us that mankind has been trying to do this for certainly hundreds of years, but the blooming of current computer technology has sparked an explosion in the research we can now do. The center of AI is the wonderful capacity we call learning, which the field is paying increasing attention to. Learning is difficult and easy, complicated and simple, and most research doesn't look at many aspects of its complexity. However, we in the AI field are starting. Let us now celebrate the efforts of our forebears and rejoice in our own efforts, so that our successors can thrive in their research. This article is the substance, edited and adapted, of the keynote address given at the 1992 annual meeting of the Association for the Advancement of Artificial Intelligence on 14 July in San Jose, California. AI Magazine 14(2): 36-48.

It might be said that there are five basic tree search algorithms for the constraint satisfaction problem (csp), namely, naive backtracking (BT), backjumping (BJ), conflict-directed backjumping (CBJ), backmarking (BM), and forward checking (FC). In broad terms, BT, BJ, and CBJ describe different styles of backward move (backtracking), whereas BT, BM, and FC describe different styles of forward move (labeling of variables). This paper presents an approach that allows base algorithms to be combined, giving us new hybrids. The base algorithms are described explicitly, in terms of a forward move and a backward move. It is then shown that the forward move of one algorithm may be combined with the backward move of another, giving a new hybrid.