Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
Trackless On-Line Paging And Computer Memory Management, Edward Benjamin Mikhalkov
Trackless On-Line Paging And Computer Memory Management, Edward Benjamin Mikhalkov
UNLV Retrospective Theses & Dissertations
We consider existing research methodology for dealing with competitiveness analysis of on-line algorithms as well as introduce some newer analysis techniques for testing research hypotheses. Paging is discussed in general and current algorithms are surveyed and analyzed; We also present a new randomized on-line algorithm for the 2-page cache problem that matches the lower bound, and, therefore, is optimal. The algorithm uses fewer resources than currently known algorithms for the same problem, and is, therefore, an improvement on existing results. Experimental findings for this new algorithm are also presented and analyzed.
A Study Of The Effect Of Computer/Internet Usage On Slot/Video Machine Players' Gambling Behaviors, Howook (Sean) Chang
A Study Of The Effect Of Computer/Internet Usage On Slot/Video Machine Players' Gambling Behaviors, Howook (Sean) Chang
UNLV Retrospective Theses & Dissertations
The Age of Information has changed the way we live since personal computers outsold TV sets, and the number of emails exceeded the number of regular stamped letters. For the last decade, the Las Vegas gaming market has changed toward not only the lavish gambling field that houses computerized slot/video machines and high speed Internet ready hotel rooms, but also a family entertainment resort and a major convention destination. These facts raised the question of how many computer/Internet literate gamblers are in Las Vegas, and whether it would influence on their slot/video machine gambling behaviors. This study found that 70% …
Two New Algorithms For Classical Problems In Computer Science, John Gerard Howe
Two New Algorithms For Classical Problems In Computer Science, John Gerard Howe
UNLV Retrospective Theses & Dissertations
This thesis presents two algorithms dealing with problems in two classic algorithm areas in computer science. The first algorithm presents a simple solution to the selection problem. The sequential computing model form of this selection algorithm is presented first followed by a general parallel computing model version; The second algorithm is a relatively simple bookkeeping approximation solution to the Steiner tree problem in graphs. The problem presented deals with determining the shortest tree connecting Steiner nodes in a graph that has no direct connections between the Steiner nodes. Both algorithms are described and analyzed in detail with an appropriate running …