نتایج جستجو برای: based tour finder
تعداد نتایج: 2941117 فیلتر نتایج به سال:
This paper describes a real-time routing system that implements a mobile museum tour guide for providing personalized tours tailored to the user position inside the museum and interests. The core of this tour guide originates from the CHIP (Cultural Heritage Information Personalization) Web-based tools set for personalized access to the Rijksmuseum Amsterdam collection. In a number of previous ...
We present an approach for the traveling salesman problem with graph metric based on Steiner cycles. A Steiner cycle is a cycle that is required to contain some specified subset of vertices. For a graph G, if we can find a spanning tree T and a simple cycle that contains the vertices with odd-degree in T , then we show how to combine the classic “double spanning tree” algorithm with Christofide...
We consider the problem of reversing a tour (i1, i2, . . . , il) in a directed graph G = (V, E) with positive integer vertices V and edges E ⊆ V × V , where ij ∈ V and (ij, ij+1) ∈ E for all j = 1, . . . , l − 1. The tour can be processed in last-in-first-out order as long as the size of the corresponding stack does not exceed the available memory. This constraint is violated in most cases when...
Computational Linguistic refers to the development of computer systems that deal with human languages. In this paper, different Techniques such as Parts Speech (POS) tagger, ‘Sandhi’ Splitter, ‘Alankaar’ Finder and ‘Samaas’ were considered. After a thorough literature review, it was found fifteen techniques used for POS tagging, nine splitting, one work is done finder absolutely no are availabl...
In this paper, we systematically explore an itemset-based extension approach for generating candidate sequence which contributes to a better and more straightforward search space traversal performance than traditional item-based extension approach. Based on this candidate generation approach, we present FINDER, a novel algorithm for discovering the set of all frequent sequences. FINDER is compo...
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...
In this paper some experimental sequential models for the simulation of trip-chains are presented; the models have been calibrated on the base of a survey made in a medium-sized town. This work is part of a research, effected by the Department of Regional Planning of the University of Calabria, to forecast travel demand and to analyse travel behaviour of the transport system users. (Festa et al...
In this work, we present a path-planning method for the Mobile Data Collector (MDC) in a wireless sensor network (WSN). In our method, a tour for the MDC is generated such that the latency of delivering data to the sink is reduced. We show that the TSP tour covers all the nodes of the WSN. However, the latency for the TSP tour may be prohibitively high for delay-sensitive real-time WSNs. We red...
The engineering practice in general requires the ability to recognize possible hazards associated with coordinated production process. Solid particles found air can potentially be one of these, therefore it is fundamental deal risk posed by certain types dusts. An industrial cyclone an equipment which designed separate hazardous material from harmless matter within air. First and foremost effic...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید