• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 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

Dvimačio giljotininio pjaustymo sprendimo metodai ir jų tyrimas / Solution and analysis of two dimensions guillotinable cut problem

Ragaišis, Vaidotas 11 August 2008 (has links)
Pateikti dažniausiai naudojami algoritmai bei pasiūlyti 6 jų pagerinimai. Pasiūlytos euristikos: dviejų stulpelių euristika(2C), vieno stulpelio euristika(1C), rūšiavimas pagal aukštį(SH), rūšiavimas pagal plotį(SW), rūšiavimas pagal plotą(SS) ir rūšiavimas pagal stačiakampių kvadrantingumą(SSN). Eksperimentui buvo pasirinkti septynių skirtingų klasių Hopper and Turton testiniai duomenys (2002). Eksperimento rezultatai įvertinti F-testu, chi-kvadrato testu bei pjaustymo efektyvumu. / During the period of implementation we implemented a number of level heuristics from the literature and proposed possible improvements to some of these algorithms. 6 algorithms were compared in terms of their solution qualities and their ability to obtain the smallest strip height. The results of the analyses of variance indicate that statistically, there is difference between the mean strip heights obtained by the algorithms at a 5% level of significance. The algorithms were also compared in terms of how close the strip heights obtained were to the optimal solution.

Page generated in 0.0598 seconds