Given a graph ( , ) G N E  , the Covering Salesman Problem (CSP) is to identify the minimum length tour “covering” all the nodes. More specifically, it seeks the minimum length tour visiting a subset of the nodes in N such that each node i not on the tour is within a predetermined distance di of a node on the tour. In this paper, we define and develop a generalized version of the CSP, and refe...

This paper describes some recent results regarding the employment of natural language processing techniques in the FAQ FINDER system. FAQ FINDER is a natural language question-answering system that uses files of frequently-asked questions as its knowledge base. Unlike AI questionanswering systems that focus on the generation of new answers, FAQ FINDER retrieves existing ones found in frequently...

Many animals acquire food by stealing it from others. There are species of specialist thieves, but more commonly animals will search for both food items and items already found by others, often conspecifics, that can be stolen. This type of behaviour has previously been modelled using a range of approaches. One of these is the Finder–Joiner model, where one animal, the ‘‘Finder’’, discovers a f...

An analyzing method of circular tour activity based on GPS in order to realize suitable tourism promotion for current tourism is given in our paper. This paper focuses on circular tour activity with rent-a-car. Our method concerns basic activity information which includes the information about destinations and movements on circular tour, based on GPS log. The analysis for circular tour activity...

In this paper we examine requirements for an infrastructure that supports implementation and deployment of smart things in the real world. We describe a case study (RFID Chef) where kitchen items and ingredients, equipped with remotely accessible electronic tags, drive an interactive context-aware recipe finder through the use of an event-based infrastructure.

The traveling salesman problem is a problem of finding the shortest tour through given points. In 1959, Beardwood, Halton, and Hammersley studied asymptotic length of the shortest tour through points on Euclidean space. In particular they described the optimal tour length with Euclidean dimension for the case that points are distributed with respect to Lebesgue absolutely continuous measure. In...

D-Finder tool implements a compositional method for the verification of component-based systems described in BIP language encompassing multi-party interaction. For deadlock detection, D-Finder applies proof strategies to eliminate potential deadlocks by computing increasingly stronger invariants.

A watchman tour in a polygonal domain (for short, polygon) is a closed curve in the polygon such that every point in the polygon is visible from at least one point of the tour. We show that the length of a minimum watchman tour in a polygon P with k holes is O(per(P )+ √ k·diam(P )), where per(P ) and diam(P ) denote the perimeter and the diameter of P , respectively. Apart from the multiplicat...

58 AI MAGAZINE In this article, we present a last-minute travel application as part of a complete VIRTUAL TRAVEL AGENCY. Each year, a significant amount of tour packages are sold as last minute tours in Germany. It is impossible for a travel agent to keep track of all the offered tour packages. Electronic-commerce applications might present the best possible tour package for a specific customer...