Threshold sequencing algorithms. (c2001)

LAUR Repository

Show simple item record

dc.contributor.author Naamani, Mohamad A.
dc.date.accessioned 2011-10-13T08:19:11Z
dc.date.available 2011-10-13T08:19:11Z
dc.date.copyright 2001 en_US
dc.date.issued 2011-10-13
dc.date.submitted 2001-08
dc.identifier.uri http://hdl.handle.net/10725/756
dc.description Includes bibliographical references (p. 42). en_US
dc.description.abstract Response time in an infonnation system can be improved by reducing the number of blocks accessed when retrieving a document set. One approach is to restructure the document base in such a way that similar documents are placed close together in the file space. This ensures a greater probability that documents will be co-located within the same block. This thesis is based on a file sequencmg algorithm proposed by Lowden [Lowden 1985) and attempts to 1l'lodiiY and improve the algorithm proposed. A series of three sequencing algorithms are considered. The effect of associating weights to key tenns during document sequencing is the major area .of interest. Simulation with computer programs and statistical theories are used to analyze the performance of these algorithms. en_US
dc.language.iso en en_US
dc.subject Computer algorithms en_US
dc.title Threshold sequencing algorithms. (c2001) en_US
dc.type Thesis en_US
dc.term.submitted Summer II en_US
dc.author.degree MS in Computer Science en_US
dc.author.school Arts and Sciences en_US
dc.author.commembers Dr. Adnan Hamzeh
dc.author.commembers Dr. Abdul Nasser Kassar
dc.author.woa RA en_US
dc.description.physdesc 1 bound copy: vi, 42 leaves; tables, ill.; 30 cm. available at RNL. en_US
dc.author.division Computer Science en_US
dc.author.advisor Dr. Issam Moghrabi
dc.identifier.doi https://doi.org/10.26756/th.2001.12 en_US
dc.publisher.institution Lebanese American University en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account