نتایج جستجو برای: package tour

تعداد نتایج: 55949  

2005
T. Shiraishi

In our previous work, we have proposed a personal navigation system called P-Tour, which facilitates tourists to compose a schedule to visit multiple destinations taking into account their preferences and time restrictions. In this paper, we extend P-Tour in the following two ways: (1) allowing users to optimize their tour schedules under multiple conflicting criteria such as total expenses and...

2003
ZOU Peng ZHOU Zhi CHEN Guo-Liang GU Jun

The TSP (traveling salesman problem) is one of the typical NP-hard problems in combinatorial optimization problem. The fast and effective approximate algorithms are needed to solve the large-scale problem in reasonable computing time. The known approximate algorithm can not give a good enough tour for the larger instance in reasonable time. So an algorithm called multilevel reduction algorithm ...

2005
Klaus ten Hagen Ronny Kramer Marcel Hermkes Bjoern Schumann Patrick Mueller

A lack of information forces many tourists on the same crowded paths. The Dynamic Tour Guide (DTG) is a mobile agent hich computes an itinerary of a couple of hours to explore a city. For this the DTG interrogates Tour Building Blocks (TBB), e.g. potential sights or restaurants, to determine current information, e.g. opening hours or availability. An ontology is used to capture the profiles of ...

2011
Fredric D Wolinsky Mark W Vander Weg M Bryant Howren Michael P Jones Rene Martin Tana M Luger Kevin Duff Megan M Dotson

Objectives The Iowa Healthy and Active Minds Study is a four-arm randomised controlled trial of a visual processing speed training programme (Road Tour). This article presents the preplanned interim results immediately after training (6-8 weeks post-randomisation) for the primary outcome. Design Within two age strata (50-64 vs ≥65), 681 men and women attending general internal and family medic...

2004
G. Ryder P. A. Flack Andrew M. Day

In current city visualisations crowds are being included to increase realism in the scene. With the self-steering nature of crowds it is traditionally difficult to control the number of humans that could be in view at any one time. While rendering speedups have been successfully applied for many years, this paper takes another approach with the aim to keep a steady frame rate. We attempt to inf...

2015
Josep Bosch Pere Ridao David Ribas Nuno Gracias

The use of omnidirectional cameras underwater is enabling many new and exciting applications in multiple fields. Among these, the creation of virtual tours from omnidirectional image surveys is expected to have a large impact in terms of science and conservation outreach. These surveys can be performed by Remotely Operated Vehicles (ROVs) and Autonomous Underwater Vehicles (AUVs) that can cover...

2002

Jafari , Jafar , J . R. Brent Rltchie, Toward a F ramework For Tour i sm Education: Problems and Prospects. Annals of Tour i sm Research 1981, VIII(I):13-34. The purpose of this article is to offer a f ramework for analysis and discussion of tour ism education. It first adopts a definition of tour ism within which interaction among its componen t s and ex t raneous aspects are considered. Speci...

Journal: :CoRR 2012
Amelia Carolina Sparavigna Roberto Marazzato

Here we propose a tour about the life of Isaac Newton, using a georeferenced method, based on the free satellite maps. Our tour is modelled on the time-line of the great scientist’s life, as an ancient “itinerarium” was modelled on the Roman roads, providing a listing of places and intervening distances, sometimes with short description or symbols concerning the places. KML language and Google ...

1997
Thorsten Joachims Dayne Freitag Tom M. Mitchell

1 We explore the notion of a tour guide software agent for assisting users browsing the World Wide Web. A Web tour guide agent provides assistance similar to that provided by a human tour guide in a museum { it guides the user along an appropriate path through the collection, based on its knowledge of the user's interests, of the location and relevance of various items in the collection, and of...

2017
Alice Paul Daniel Freund Aaron Ferber David B. Shmoys David P. Williamson

We consider constrained versions of the prize-collecting traveling salesman and the minimum spanning tree problems. The goal is to maximize the number of vertices in the returned tour/tree subject to a bound on the tour/tree cost. We present a 2-approximation algorithm for these problems based on a primal-dual approach. The algorithm relies on finding a threshold value for the dual variable cor...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید