A Survey of Artificial Intelligence Research at the IIIA

The algorithm selection problem is concerned with selecting the best algorithm to solve a given problem instance on a case-by-case basis. It has become especially relevant in the last decade, with researchers increasingly investigating how to identify the most suitable existing algorithm for solving a problem instance instead of developing new algorithms. This survey presents an overview of this work focusing on the contributions made in the area of combinatorial search problems, where algorithm selection techniques have achieved significant performance improvements. We unify and organise the vast literature according to criteria that determine algorithm selection systems in practice.

A Survey of Artificial Intelligence Research at the IIIA Abstract The IIIA is a public research centre, belonging to the Spanish National Research Council (CSIC), dedicated to AI research. We focus our activities on a few well-defined sub-domains of Artificial Intelligence, positively avoiding dispersion and keeping a good balance between basic research and applications, and paying particular attention to training PhD students and technology transfer. In this article, we survey some of the most relevant results we have obtained during the last 12 years.

Computational sustainability problems, which exist in dynamic environments with high amounts of uncertainty, provide a variety of unique challenges to artificial intelligence research and the opportunity for significant impact upon our collective future. This editorial introduction provides an overview of artificial intelligence for computational sustainability, and introduces the special issue articles that appear in this issue and the previous issue of AI Magazine.

It was founded in 1991 and, since 1994, has been located on the campus of the Autonomous University of Barcelona. IIIA grew out of an AI research group at the Center for Advanced Studies in Blanes (Spain) that started AI research in 1985. On average IIIA has had about 50 members per year during the last 12 years with a peak of almost 80 members in 2012. In total around 200 different people, including visiting researchers as well as master's and Ph.D. students, have been members of IIIA over the past 20 years. Seventy-seven students have completed their Ph.D. work at our Institute, 48 of them during the last 12 years.

The algorithm selection problem is concerned with selecting the best algorithm to solve a given problem instance on a case-by-case basis. It has become especially relevant in the last decade, with researchers increasingly investigating how to identify the most suitable existing algorithm for solving a problem instance instead of developing new algorithms. This survey presents an overview of this work focusing on the contributions made in the area of combinatorial search problems, where algorithm selection techniques have achieved significant performance improvements. We unify and organise the vast literature according to criteria that determine algorithm selection systems in practice. The comprehensive classification of approaches identifies and analyses the different directions from which algorithm selection has been approached. This article contrasts and compares different methods for solving the problem as well as ways of using these solutions.

Participants Intelligence (AAAI-15) and the Twenty-Seventh Conference in the AAAI-15 Robotics Exhibition and the on Innovative Applications of Artificial Intelligence AAAI-15 Video Competition are encouraged to contribute (IAAI-15) will be held January 25-29 at the to the Demonstration Program with their systems, Hyatt Regency Austin in Austin, Texas, USA. AAAI is working October 8 (Papers Due) closely with the local AI community to create opportunities The Senior Member Track provides an opportunity for attendees to experience AI in Texas! Attendees for established researchers in the AI community to can also enjoy nearly 200 music venues that feature give a broad talk on a well-developed body of everything from rock and blues to country and research, an important new research area, or a promising jazz every night of the week. Austin cuisine has new topic. This year, new "Blue Sky Ideas" track expanded from barbecue and Tex-Mex to award-winning is seeking presentations aimed at presenting ideas and inventive international cuisine, and blossomed and visions that can stimulate the research community beyond brick-and-mortar restaurants to a to pursue new directions, such as new problems, vibrant, citywide food truck movement.

Computational sustainability problems, which exist in dynamic environments with high amounts of uncertainty, provide a variety of unique challenges to artificial intelligence research and the opportunity for significant impact upon our collective future. This editorial introduction provides an overview of artificial intelligence for computational sustainability, and introduces the special issue articles that appear in this issue and the previous issue of AI Magazine.

Concept map is a graphical tool for representing knowledge. They have been used in many different areas, including education, knowledge management, business and intelligence. Constructing of concept maps manually can be a complex task; an unskilled person may encounter difficulties in determining and positioning concepts relevant to the problem area. An application that recommends concept candidates and their position in a concept map can significantly help the user in that situation. This paper gives an overview of different approaches to automatic and semi-automatic creation of concept maps from textual and non-textual sources. The concept map mining process is defined, and one method suitable for the creation of concept maps from unstructured textual sources in highly inflected languages such as the Croatian language is described in detail. Proposed method uses statistical and data mining techniques enriched with linguistic tools. With minor adjustments, that method can also be used for concept map mining from textual sources in other morphologically rich languages.

Social intelligence in natural and artificial systems is usually measured by the evaluation of associated traits or tasks that are deemed to represent some facets of social behaviour. The amalgamation of these traits is then used to configure the intuitive notion of social intelligence. Instead, in this paper we start from a parametrised definition of social intelligence as the expected performance in a set of environments with several agents, and we assess and derive tests from it. This definition makes several dependencies explicit: (1) the definition depends on the choice (and weight) of environments and agents, (2) the definition may include both competitive and cooperative behaviours depending on how agents and rewards are arranged into teams, (3) the definition mostly depends on the abilities of other agents, and (4) the actual difference between social intelligence and general intelligence (or other abilities) depends on these choices. As a result, we address the problem of converting this definition into a more precise one where some fundamental properties ensuring social behaviour (such as action and reward dependency and anticipation on competitive/cooperative behaviours) are met as well as some other more instrumental properties (such as secernment, boundedness, symmetry, validity, reliability, efficiency), which are convenient to convert the definition into a practical test. From the definition and the formalised properties, we take a look at several representative multi-agent environments, tests and games to see whether they meet these properties.