• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • 1
  • Tagged with
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Turizmo agentūros užsakymu apskaitos sistema / Tourism agency orders managing system

Būtėnas, Marius 13 January 2005 (has links)
The main objective of this work was to develop and implement the travel reservation system, which would be easy to use, widely accessible for large amount of users, progressive and works without mistakes. This system would allow users to save time planning job or holiday trip. The project was implemented using PHP and Microsoft SQL. The program performs a lot of functions: booking of tickets, hotels and additional services, travel routes catalog review and personal trip design, edition of the reservations that has been already made. These are only several features from the travel reservation system, which would help to plan holiday or job trip.
2

Predicting low airfares with time series features and a decision tree algorithm

Krook, Jonatan January 2018 (has links)
Airlines try to maximize revenue by letting prices of tickets vary over time. This fluctuation contains patterns that can be exploited to predict price lows. In this study, we create an algorithm that daily decides whether to buy a certain ticket or wait for the price to go down. For creation and evaluation, we have used data from searches made online for flights on the route Stockholm – New York during 2017 and 2018. The algorithm is based on time series features selected by a decision tree and clearly outperforms the selected benchmarks.

Page generated in 0.0467 seconds