See Leuski et al. (2006) and to the same question -- for example, "What Leuski and Traum (2008) for more details. is your name?" -- depending on who the interactor The final parameter is the classification threshold is looking at. NPCEditor's user interface allows the on the KL-divergence value: only answers that designer to define arbitrary annotation classes or score above the threshold value are returned from categories and specify which of these annotation the classifier. The threshold is determined by tuning categories should be used in classification.

Cancer kills millions of people each year. From an AI perspective, finding effective treatments for cancer is a high-dimensional search problem characterized by many molecularly distinct cancer subtypes, many potential targets and drug combinations, and a dearth of high quality data to connect molecular subtypes and treatments to responses. The broadening availability of molecular diagnostics and electronic medical records, presents both opportunities and challenges to apply AI techniques to personalize and improve cancer treatment. We discuss these in the context of Cancer Commons, a “rapid learning” community where patients, physicians, and researchers collect and analyze the molecular and clinical data from every cancer patient, and use these results to individualize therapies. Research opportunities include: adaptively-planning and executing individual treatment experiments across the whole patient population, inferring the causal mechanisms of tumors, predicting drug response in individuals, and generalizing these findings to new cases. The goal is to treat each patient in accord with the best available knowledge, and to continually update that knowledge to benefit subsequent patients. Achieving this goal is a worthy grand challenge for AI.

This text provides a clear and systematic development of the essentials of mobile robotics. The second edition adds up-to-date material to a book that has already been adopted in robotics classes worldwide. With this guide in hand, students and readers will swiftly navigate the field toward more advanced systems.

The development of intelligent environments is considered the first and primary step toward the realization of the ambient intelligence vision and requires input from research and contributions from several scientific and engineering disciplines, including computer science, software engineering, artificial intelligence, architecture, social sciences, art, and design. IE conferences create a unique blend of researchers in these disciplines and foster crossdisciplinary discussions, debate, and collaborations. The Sixth International Conference on Intelligent Environments (IE 10) was held July 19-21 at the Sunway campus of Monash University, Kuala Lumpur, Malaysia. The general chairs were Simon Egerton of Monash University and Ichiro Satoh of the Japanese National Institute of Informatics. Vic Callaghan of the University of Essex, UK, and Achilles Kameas of the Hellenic Open University and Computer Technology Institute, Greece, served as program chairs.

In this article, we discuss the problem of transferring search heuristics from one planner to another. More specifically, we demonstrate how to transfer the domain-dependent heuristics acquired by one planner into a second planner. Our motivation is to improve the efficiency and the efficacy of the second planner by allowing it to use the transferred heuristics to capture domain regularities that it would not otherwise recognize. Our experimental results show that the transferred knowledge does improve the second planner's performance on novel tasks over a set of seven benchmark planning domains.

Software defect prediction aims to reduce software testing efforts by guiding testers through the defect-prone sections of software systems. Defect predictors are widely used in organizations to predict defects in order to save time and effort as an alternative to other techniques such as manual code reviews. The usage of a defect prediction model in a real-life setting is difficult because it requires software metrics and defect data from past projects to predict the defect-proneness of new projects. It is, on the other hand, very practical because it is easy to apply, can detect defects using less time and reduces the testing effort. We have built a learning-based defect prediction model for a telecommunication company in the space of one year. In this study, we have briefly explained our model, presented its pay-off and described how we have implemented the model in the company. Furthermore, we compared the performance of our model with that of another testing strategy applied in a pilot project that implemented a new process called Team Software Process (TSP). Our results show that defect predictors can predict 87 percent of code defects, decrease inspection efforts by 72 percent and hence, reduces post-release defects by 44 percent. Furthermore, they can be used as complementary tools for a new process implementation whose effects on testing activities are limited.

Constraint propagation is one of the basic forms of inference in many logic-based reasoning systems. In this paper, we investigate constraint propagation for first-order logic (FO), a suitable language to express a wide variety of constraints. We present an algorithm with polynomial-time data complexity for constraint propagation in the context of an FO theory and a finite structure. We show that constraint propagation in this manner can be represented by a datalog program and that the algorithm can be executed symbolically, i.e., independently of a structure. Next, we extend the algorithm to FO(ID), the extension of FO with inductive definitions. Finally, we discuss several applications.

The theoretical limits of'lossy' data compression algorithms are considered. The complexity of an object as seen by a macroscopic observer is the size of the perceptual code which discards all information that can be lost without altering the perception of the specified observer. The complexity of this macroscopically observed state is the simplest description of any microstate comprising that macrostate. Inference and pattern recognition based on macrostate rather than microstate complexities will take advantage of the complexity of the macroscopic observer to ignore irrelevant noise. Information theory in its modern form originated from Claude Shannon's[22] usage of Gibbs' entropy formula to describe communication channels: S k P In the context of quantum mechanics, it becomes the von Neumann entropy of the state density matrix, S trace(plogp). The story goes that it was actually von Neumann who suggested the term'entropy' to Shannon for his information function, for two reasons: 'In the first place your uncertainty function has been used in statistical mechanics under that name, so it already has a name. In the second place, and more important, nobody knows what entropy really is, so in a debate you will always have the advantage.'

The Pancake problem has become a classical combinatorial problem. Different attempts have been made to optimally solve it and/or to derive tighter bounds on the diameter of its state space for a different number of discs. Until very recently, the most successful technique for solving different instances optimally was based on Pattern Databases. Although different approaches have been tried, solutions with Pattern Databases on Pancakes with more than 19 discs have never been reported. In this work, a new technique is introduced which allows the definition of Additive Pattern Databases for solving Pancakes of an arbitrary length. As a result, this technique solves Pancake problems with twice as many discs as the largest ones solved nowadays with other techniques based on Pattern Databases saving up to two orders of magnitude of space.

In this paper we describe novel representations for precomputed heuristics based on Level-Ordered Edge Sequence (LOES) encodings. We introduce compressed LOES, an extension to LOES that enables more aggressive compression of the state-set representation. We evaluate the novel repre- sentations against the respective perfect-hash and binary decision diagram (BDD) representations of pattern databases in a variety of STRIPS domains.